C++ Implementation of a Binary Heap

binary treecdata structuresheap

I need a min-heap implemented as a binary tree. Really fast access to the minimum node and insertion sort.

Is there a good implementation in stl or boost that anyone can point me too?

Best Answer

I think std::priority_queue is what you are looking for.