C++ Implementation of a Binary Heap

Question

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?

Answer 1

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

Answer 2

See the Standard C++ algorithm make_heap().

Answer 3

The STL doesn't have a concept of (binary) trees, but there are methods that facilitate in maintaining heap properties in a dataset, such as std::make_heap, std::sort_heap, std::push_heap et cetera.