Set 09 - Binary Trees
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 102. Binary Tree Level Order Traversal | Medium | BFS | Video |
| LC 199. Binary Tree Right Side View | Medium | BFS | Video |
| LC 98. Validate Binary Search Tree | Medium | DFS + Range | Video |
| LC 230. Kth Smallest Element in BST | Medium | Inorder | 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 102: BFS level order; process by level size.
- LC 199: BFS; take last node per level.
- LC 98: DFS with min/max bounds; strict inequality.
- LC 230: inorder traversal yields sorted; count kth.
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...