PHASE 08
๐ณ Trees & Heaps
Family trees, folders and tournament brackets. Learn tree vocabulary, DFS and BFS traversals, the ordered magic of binary search trees, and heaps for “top K” problems.
โฑ๏ธ ~2 hours of lessons
๐ 3 lessons
โ๏ธ 5 exercises Medium
โถ Start this phase
๐ฏ In this phase you willโฆ
- Traverse trees depth-first and breadth-first
- Use the binary search tree property
- Solve top-K problems with a heap
๐บ Lessons in this playlist
๐ Phase test
Concept questions, pseudocode writing, tracing and debugging โ check youโre ready for the next phase.
๐ก Concept check
In-order traversal of a binary search tree visits the valuesโฆ
