A min-max heap is a data Structure that supports both deleteMin and deleteMax in

Question

A min-max heap is a data Structure that supports both deleteMin and deleteMax in O(logN) per operation. The structure is identical to a binary heap, but the heap-order property is that for any node, X, at even depth, the element stored at X is smaller than the parent but larger than the grandparent (where this makes sense), and for any node X at odd depth, the element stored at X is larger than the parent but smaller than grandparent. See Fig. a. How do we find the minimum and maximum element? b. Give an algorithm to insert a new node into the min-max heap.

Explanation / Answer

To add an element to a min-max heap perform following operations:

Append the required key to the array representing the min-max heap. This will likely break the min-max heap properties, therefore we need to adjust the heap.

Compare this key with its parent:

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.