Queue • C++ STL

std::priority_queue

The C++ Standard Template Library implementation of a Max-Heap. It automatically keeps the largest element at the top.

Default Behavior (Max-Heap)

If you declare `priority_queue<int> pq;`, it behaves as a Max-Heap. The element with the highest value will always be popped first.

Customizing to Min-Heap

To make it a Min-Heap, you must pass a vector and a comparator: `priority_queue<int, vector<int>, greater<int>> pq;`. Now, the smallest element is popped first.

Performance

`push()` and `pop()` operate in O(log N) time, as the heap must re-balance itself. `top()` operates in O(1) time, instantly retrieving the highest priority element.

Loading Lab...

Stl Priority Queue Stl

Stl Priority Queue Stl

std::priority_queue

Default Behavior (Max-Heap)

Customizing to Min-Heap

Performance

std::priority_queue

Default Behavior (Max-Heap)

Customizing to Min-Heap

Performance