Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Sorting
The elements 42, 25, 30, 40, 22, 35, 26 are inserted one by one in the given order into a max heap. The resultant max-heap is stored in an array implementation as
1
<42, 35, 40, 22, 25, 26, 30>
2
<42, 35, 40, 22, 25, 30, 26>
3
<42, 40, 35, 25, 22, 26, 30>
4
<42, 40, 35, 25, 22, 30, 26>