<p>This is the original proposal for MinMaxHeaps:</p>

<p><a href="http://www.cs.otago.ac.nz/staffpriv/mike/Papers/MinMaxHeaps/MinMaxHeaps.pdf" rel="noreferrer">http://www.cs.otago.ac.nz/staffpriv/mike/Papers/MinMaxHeaps/MinMaxHeaps.pdf</a></p>

<p>I've implemented a heap off this and found it to be very simple. An improvement which I've personally never implemented is a min max fine heap:</p>

<p><a href="http://arxiv.org/ftp/cs/papers/0007/0007043.pdf" rel="noreferrer">http://arxiv.org/ftp/cs/papers/0007/0007043.pdf</a></p>
MinMax Heap Algorithm Implementation
<p>I searching <strong>minmax heap</strong> algorithm implementation,
i remember some things about this structure, her implementation is on one heap.
Even levels (floors) in heap tree is a min colored, and rest of nodes is max colored.
I remember some draft of workings of this but i searching some good document about it or some <code>C</code> or <code>C++</code> code snippet, i can't find any useful information's by Google, i think is a non widespread algorithm.</p>

<p>Greetings and Thanks for helpful answers.</p>