Set 10 - Binary Trees
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 235. Lowest Common Ancestor of BST | Medium | BST Property | Video |
| LC 236. Lowest Common Ancestor of BT | Medium | DFS | Video |
| LC 297. Serialize and Deserialize BT | Hard | BFS/DFS | Video |
| LC 124. Binary Tree Maximum Path Sum | Hard | DFS + Global Max | 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 235: BST property; move left/right by value.
- LC 236: DFS; return node when both sides hit.
- LC 297: BFS/DFS with null markers; reversible parse.
- LC 124: DFS max gain; global max; drop negatives.
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...