CSCI2100 · Theorem · Chapter 3 · Priority queues
Sift-down repairs an almost-heap
4 steps of prerequisites below it
If the array is an almost-heap at i, sift-down at i stops after at most h(i) swaps and makes the subtree at i a min-heap with the same keys, changing no other position.
Taught in
- 3.2 Building a min-heap from the bottom up · introduced
Uses
- Almost-heap at an index · used in its proof, proof step 3.2
- Sift-down · used in its definition, passage 3.2
Used by
Everything this builds on, earliest first · 4 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
- Binary min-heap · 3.1
- Almost-heap at an index · 3.2
- Sift-down · 3.2
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.