C++ Implementation of a Binary Heap
11,782
Solution 1
I think std::priority_queue is what you are looking for.
Solution 2
See the Standard C++ algorithm make_heap().
Comments
-
Dan almost 2 years
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?
-
David Rodríguez - dribeas about 15 yearsThanks Hank, I forgot to link it :)