MADEEASY

Question

Comments

for heapifying, you have to know the concept of MIN-MAX heap, but i hope it is not in the syllabus of GATE.

---

but i hope it is not in the syllabus of GATE. 

WHAT IS NOT IN THE SYLLABUS?

AND ACTUALLY I AM FINIDING DIFFICULTY TO APPLY HEAPIFY BECZ LEVELS HAVE SOME PROPERTY IN THIS NOT LIKE USUAL HEAP

---

i mean, MIN-MAX heap is not in the syllabus.

if you are interested you can google it, you can easily find the procedure, it is famous Data Structure

Answer 1

The delete procedure is similar to a normal heap data structure with little modifications.

Consider deletion of min element i.e. the root element at level 0.

Root element then must be replaced by last element of lower most even level after which HEAPIFY procedure can be called considering only even levels of the min-max heap. This procedure will be O(logn).

Similarly deletion of max element i.e one of the two elements in level 1 will cost O(logn) which will consider only odd levels in its HEAPIFY procedure.