CS Foundations & Interview PrepIntermediate7 modules~3.5 hours hands-on3 learning modes
Graph & Tree Interview Patterns
Recognize and solve the traversal-based tree and graph problems interviewers ask, by pattern, not by memorization.
// What you'll be able to do- DFS orders and BFS levels on trees
- Height, LCA, and validating a BST
- Adjacency list vs matrix, BFS vs DFS
- BFS on unweighted, Dijkstra on weighted
7 modules, built to run
Every module ships runnable code. Expand any one to see what's inside.
00IntroductionWhy traversal is the master key30 min
Objective — Why traversal is the master key
Start moduleFree preview
01Trees & TraversalsDFS orders and BFS levels on trees30 min
Objective — DFS orders and BFS levels on trees
02Binary Tree & BST ProblemsHeight, LCA, and validating a BST30 min
Objective — Height, LCA, and validating a BST
03Graphs - Representation & TraversalAdjacency list vs matrix, BFS vs DFS30 min
Objective — Adjacency list vs matrix, BFS vs DFS
04Shortest PathsBFS on unweighted, Dijkstra on weighted30 min
Objective — BFS on unweighted, Dijkstra on weighted
05Cycles, Ordering & ConnectivityCycle detection, topological sort, union-find30 min
Objective — Cycle detection, topological sort, union-find
06Pattern SynthesisRoute any tree/graph problem to its technique30 min
Objective — Route any tree/graph problem to its technique
Ready to start Graph & Tree Interview Patterns?
Start with the free Module 0, then unlock the full course on a Pro plan.