๐Ÿง  DSA & Interview Prep
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

01 Binary Trees & Traversals โฑ๏ธ 45 min โœ๏ธ 1 activities 02 Binary Search Trees โฑ๏ธ 40 min โœ๏ธ 1 activities 03 Heaps & Priority Queues โฑ๏ธ 40 min โœ๏ธ 1 activities

๐Ÿ“ 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โ€ฆ