1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
property and a heap that satisfies this property is known as maximum
heap.
If the order property is such that for every node in the heap, the value stored in
that node is less than or equal to the value in each of its children, then that
heap is known as minimum heap.
STEPS IN HEAP SORT
Heap sort follows two main steps:‐
Step I:‐ creation of heap
Step II:‐ operation on heap
CREATION OF HEAP
A heap is a complete binary tree in which every node satisfies the heap
condition.
HEAP CONDITION
A complete binary tree is said to satisfy the heap condition if the key of each
node is greater than or equal to the key in its children.
Thus the root node will have the largest key value
OPERATION ON HEAP
The steps of operations are as follows:‐
Step I – Remove the root node of the heap and insert it into the sorted list from
right to left.
Step II‐ Replace the deleted element (root) by the last element.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 17 ‐