← All courses
🌳Intermediate

Trees, Heaps & Tries

Hierarchical data at depth: binary trees and traversals (DFS & BFS), binary search trees, balancing intuition, heaps and priority queues, tries, and the recursion patterns that solve tree problems.

Volume 4 · Part V · 9 chapters · 9 lessons
Share

What you'll learn

  • Binary Trees
  • Tree Traversals (DFS)
  • Breadth-First Traversal (BFS)
  • Binary Search Trees
  • Balanced Trees
  • Heaps & Priority Queues
  • Heap Patterns (Top-K)
  • Tries
  • Tree Problem Patterns

Curriculum

4 modules · 9 lessons
Module 1Trees & Traversal3 lessons
Binary TreesPreview
Tree Traversals (DFS)
Breadth-First Traversal (BFS)
Module 2Search Trees2 lessons
Binary Search Trees
Balanced Trees
Module 3Heaps2 lessons
Heaps & Priority Queues
Heap Patterns (Top-K)
Module 4Tries & Patterns2 lessons
Tries
Tree Problem Patterns

Reviews

No reviews yet.

More courses

Browse all →