Set 08 - Binary Trees
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 226. Invert Binary Tree | Easy | DFS Recursive | Video |
| LC 104. Maximum Depth of Binary Tree | Easy | DFS | Video |
| LC 100. Same Tree | Easy | DFS Compare | Video |
| LC 572. Subtree of Another Tree | Easy | DFS + Same Tree | Video |
Deliverables
- Write a 1-line invariant for each problem.
- Note 1 edge case or pitfall per problem.
- Record time-to-first-correct solution.
Notes
- LC 226: swap left/right in DFS; base case null.
- LC 104: depth = 1 + max(left, right).
- LC 100: DFS compare values and structure.
- LC 572: DFS each node + sameTree check.
Review
- Time spent + where you got stuck?
- Biggest mistake or missed edge case?
- One concrete improvement for next time.
Comments
Share your approach or ask questions
?
|
Markdown supported
Sign in to post
Loading comments...