1. 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.

How do we find the minimum and maximum element?

Give an algorithm to insert a new node into the min-max heap.

2. Merge the two binomial queues

81 87 17 14 12 78 71 80 20 31) 59) 16 (24) 79) 63) 18) (19) 32) 13) 15) 48 Figure 6.57 Min-max heap 31 28