Scribd
Upload
4 views2 pages

Heap Note

A heap is a balanced binary tree where the root node's key is compared to its children's keys, resulting in either a Max Heap or a Min Heap. The document outlines the construction algorithms for both Max Heap and Min Heap, detailing the steps for inserting and deleting nodes while maintaining the heap property. It provides a specific example of input values to illustrate the Max Heap construction process.

Uploaded by

manavasharma5465
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views2 pages

Heap Note

A heap is a balanced binary tree where the root node's key is compared to its children's keys, resulting in either a Max Heap or a Min Heap. The document outlines the construction algorithms for both Max Heap and Min Heap, detailing the steps for inserting and deleting nodes while maintaining the heap property. It provides a specific example of input values to illustrate the Max Heap construction process.

Uploaded by

manavasharma5465
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

DATA STRUCTURE - HEAP

[Link] Copyright © [Link]

Heap is a special case of balanced binary tree data structure where root-node key is compared
with its children and arranged accordingly. If α has child node β then −

keyα ≥ keyβ

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 −

For Input → 35 33 42 10 14 19 27 44 26 31

Min-Heap − where the value of root node is less than or equal to either of its children.

Max-Heap − where the value of root node is greater than or equal to either of its children.

Both trees are constructed using the same input and order of arrival.

Max Heap Construction Algorithm


We shall use the same example to demonstrate how a Max Heap is created. The procedure to
create Min Heap is similar but we go for min values instead of max ones.

We are going to derive an algorithm for max-heap by inserting one element at a time. At any point
of time, heap must maintain its property. While insertion, we also assume that we are inserting a
node in already heapified tree.

Step 1 − Create a new node at the end of heap.


Step 2 − Assign new value to the node.
Step 3 − Compare the value of this child node with its parent.
Step 4 − If value of parent is less than child, then swap them.
Step 5 − Repeat step 3 & 4 until Heap property holds.

Note − In Min Heap construction algorithm we expect the value of parent node to be less than that
of child node.

Let's understand Max Heap construction by an animated illustration. We take the same input
sample that we use earlier.

Max Heap Deletion Algorithm


Lets derive an algorithm to delete from max-heap. Deletion in Max orMin Heap is always happen at
the root to remove the Maximum orminimum value.

Step 1 − Remove root node.


Step 2 − Move the last element of last level to root.
Step 3 − Compare the value of this child node with its parent.
Step 4 − If value of parent is less than child, then swap them.
Step 5 − Repeat step 3 & 4 until Heap property holds.

Loading [MathJax]/jax/output/HTML-CSS/[Link]

You might also like