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.

Give an algorithm (Java pseudocode) to insert a new node into the min-max heap.

81 87 14 17 12 28 71 25 80 20 52 78 31 42 31 5916 (2479 63 1819(32131548 Figure 6.57 Min-max heap