Min Max Heap Algorithm

The impression of min-max ordering can be extended to other structures based on the max- or min-ordering, such as leftist trees, generate a new (and more powerful) class of data structures. In computer science, a min-max heap is a complete binary tree data structure which combines the usefulness of both a min-heap and a max-heap, that is, it provides constant time retrieval and logarithmic time removal of both the minimal and maximal components in it.

Min Max Heap source code, pseudocode and analysis