Module 4 · Lesson 2
Heaps and Priority Queues
A heap is a tree that always keeps the smallest (or largest) value at the root. Powers priority queues.
Lesson preview — the full write-up and code playground unlock with All Access.
Trees, Graphs & Hashing is part of All Access
The first two coding modules are free. All Access unlocks the other ten — 41 more lessons through system design — for $9.99/month or $89 once, forever.
Already have All Access? Sign in