Max Heap: Introduction

This lesson will give a brief introduction to Max-Heaps and how their elements are inserted or removed from Max-Heaps.

We'll cover the following

- Building a Max-Heap
- Insertion in a Max-Heap
- Remove Maximum in a Max Heap

Building a Max-Heap

As mentioned in the previous lesson, max heaps follow the max heap property which means that the key at the parent node is always greater than the keys at the child nodes. Heaps can be implemented using lists or using node and tree classes. Although they are generally implemented using lists or arrays as that is the more space-efficient approach! To build a heap, start with an empty one and successively insert() all the elements.

For a visual demonstration of heap creation, check out the following illustration.

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.

Introduction to Complexity Measures

Introduction to Lists

Introduction to Linked Lists

Introduction to Stacks and Queues

Introduction to Graphs

Introduction to Trees

Trie

Introduction to Heap

Introduction to Hashing

Summary of Data Structures

Max Heap: Introduction

Building a Max-Heap