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 the grandparent. See Figure below, which is a Min-Max Heap.

A) Design an algorithm in pseudocode (Java) to insert a new node into the min-max heap

81 87 14 17 12 52 71 80 20 78 25 31 59) 16) (24) 79 63 18 19 32 13 15 48 31 28 42