C ++ Binary Heap Implementation

Question

I need a mini-heap implemented as a binary tree. Really quick access to minimal node and insertion sort.

Is there a good implementation in stl or boost that anyone can tell 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

STL has no concept of (binary) trees, but there are methods that make it easy to store heap properties in a dataset, such as std :: make_heap, std :: sort_heap, std :: push_heap et cetera.