LECTURE 15 OF 25
Heaps
A heap keeps only one promise — instant access to the current best — and gives up full ordering to make that promise cheap to maintain.
Builds on
Best read after 2. Arrays, 14. Trees and Binary Search Trees — you can still read ahead, but some of this may lean on ideas covered there.