📄️ Min Heap
A binary min-heap priority queue where the smallest element is always at the root.
Heap
Heap-based priority queue data structure.
Heap-based priority queue data structure.
A binary min-heap priority queue where the smallest element is always at the root.