Week 3 — Trees & Graphs
Topics: Binary Trees · DFS & BFS · Graph Representation · Cycle Detection
🚧 Content coming soon. This week's material is being prepared. Check back shortly.
What you'll learn this week
- Trees as recursive structures: every subtree is itself a tree
- DFS on trees: preorder, inorder, postorder — derived, not memorised
- BFS as level-order traversal using a queue
- Graph representations: adjacency list vs matrix, and when to use each
- Detecting cycles in directed and undirected graphs
Problems to solve
| Problem | Difficulty | Pattern |
|---|---|---|
| Maximum Depth of Binary Tree | Easy | DFS |
| Binary Tree Level Order Traversal | Medium | BFS |
| Number of Islands | Medium | DFS / BFS |
| Course Schedule | Medium | Cycle Detection |
| Binary Tree Maximum Path Sum | Hard | DFS |
Full notes, code walkthroughs, and video sessions will be added here.