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.

1. buildHeap : Builds a min-max heap from a list of naturals read from standard input in C++

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