MinMax Heap Algorithm Implementation

I searching minmax heap algorithm implementation, i remember some things about this structure, her implementation is on one heap. Even levels (floors) in heap tree is a min col开发者_如何学编程ored, 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 C or C++ code snippet, i can't find any useful information's by Google, i think is a non widespread algorithm.

Greetings and Thanks for helpful answers.

---

This is the original proposal for MinMaxHeaps:

http://www.cs.otago.ac.nz/staffpriv/mike/Papers/MinMaxHeaps/MinMaxHeaps.pdf

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:

http://arxiv.org/ftp/cs/papers/0007/0007043.pdf

---

I made a little search on google and find this:

• http://www.coldbrains.com/code/code/C++/Data_Structures/Min-Max_Heap/MinMaxHeap.C.html
• http://www.coldbrains.com/code/code/C++/Data_Structures/Min-Max_Heap/MinMaxHeap.H.html