Module heapless::binary_heap
source · Expand description
A priority queue implemented with a binary heap.
Insertion and popping the largest element have O(log n)
time complexity. Checking the largest
/ smallest element is O(1)
.
Structs§
- A priority queue implemented with a binary heap.
- Structure wrapping a mutable reference to the greatest item on a
BinaryHeap
.
Enums§
- Max-heap
- Min-heap
Traits§
- The binary heap kind: min-heap or max-heap