Back to sheet
Google SDE-1 Interview Sheet
Trees
12 problems
problem
Topic Progress0 / 12 solved
Problem List
Work through the problems in sequence to build topic mastery.
| Problem | Difficulty | Status | Optional | Action |
|---|---|---|---|---|
| Same Tree | Medium | Unsolved | Required | |
| Invert Binary Tree | Medium | Unsolved | Required | |
| Maximum Depth Of Binary Tree | Medium | Unsolved | Required | |
| Balanced Binary Tree | Medium | Unsolved | Required | |
| Diameter Of Binary Tree | Medium | Unsolved | Required | |
| Path Sum | Medium | Unsolved | Required | |
| Subtree Of Another Tree | Medium | Unsolved | Required | |
| Binary Tree Level Order Traversal | Medium | Unsolved | Required | |
| Validate Binary Search Tree | Medium | Unsolved | Required | |
| Kth Smallest Element in a BST | Medium | Unsolved | Required | |
| Lowest Common Ancestor of a Binary Tree | Medium | Unsolved | Required | |
| Serialize And Deserialize Binary Tree | Medium | Unsolved | Required |
Topic Snapshot
A compact summary of what this sheet section covers and how far you have progressed.
Trees
Develop clean recursive returns, traversal state, BST bounds, and serialization fluency.
google
sde-1
Completion
0%
Problems Remaining
12
Optional Problems
0
Complete the required items first, then use optional problems for extra depth.