Binary Heap in Data Structure

Heap or Binary Heap is a special case of balanced binary tree data structure. This is complete binary tree structure. So up to l-1 levels it is full, and at l level, all nodes are from left. Here the root-node key is compared with its children and arranged accordingly. If a has child node b then −

key(a) ≥ key(b)

As the value of parent is greater than that of child, this property generates Max Heap. Based on this criteria, a heap can be of two types the Max Heap and the Min Heap.

These are examples of Max and Min Heap respectively −

Arnab Chakraborty

Updated on 10-Aug-2020 08:46:41

• Related Questions & Answers
• Insertion into a Max Heap in Data Structure
• Deletion from a Max Heap in Data Structure
• Binary Tree ADT in Data Structure
• Threaded Binary Trees in Data Structure
• Unrooted binary tree in Data Structure
• Balanced binary search trees in Data Structure
• Binary Trees as Dictionaries in Data Structure
• Array Representation Of Binary Heap
• C++ Program to Implement Binary Heap
• Rectangle Data in Data Structure
• Halfedge data structure
• Deaps in Data Structure
• Quadtrees in Data Structure
• Check if a given Binary Tree is Heap in Python
• Check if a given Binary Tree is Heap in C++