CSCI2100 · Definition · Chapter 3 · Priority queues
Binary min-heap
1 steps of prerequisites below it
A binary min-heap is an array a₁,…,aₙ, viewed as a complete binary tree with parent ⌊i/2⌋ and children 2i and 2i+1, satisfying the heap invariant that every parent key is at most its child keys.
Taught in
- 3.1 Binary min-heaps and priority queues · introduced
- 3.2 Building a min-heap from the bottom up · developed
- 14.2 Weighted graph frontiers: Dijkstra and Prim · applied
Builds on
- Min-priority queue · used in an argument or worked solution, passage 3.1
Used by
Lenses
- Positions as binary strings · Structural
Everything this builds on, earliest first · 1 steps
Each step comes after its own prerequisites, so reading in this order never needs something you have not met. It is a reading order for these notes, not a diagnosis of what you know.
- Min-priority queue · 3.1
Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.
Longest chain down to a starting point
Each step is used by the one above it, across courses where the notes link them. It ends at a point the notes define without another point.