Back to sheet
FAANG+ Advanced Sheet
Advanced Trees
10 problems
problem
Topic Progress0 / 10 solved
Problem List
Work through the problems in sequence to build topic mastery.
| Problem | Difficulty | Status | Optional | Action |
|---|---|---|---|---|
| Subtree Of Another Tree | Medium | Unsolved | Required | |
| Binary Tree Zigzag Level Order Traversal | Medium | Unsolved | Required | |
| Binary Tree Right Side View | Medium | Unsolved | Required | |
| Validate Binary Search Tree | Medium | Unsolved | Required | |
| Kth Smallest Element in a BST | Medium | Unsolved | Required | |
| Delete Node in a BST | Medium | Unsolved | Required | |
| Lowest Common Ancestor of a Binary Tree | Medium | Unsolved | Required | |
| Construct Binary Tree From Preorder And Inorder Traversal | Medium | Unsolved | Required | |
| Binary Tree Maximum Path Sum | 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.
Advanced Trees
Move beyond basics into construction, serialization, global path state, and BST order statistics.
faang-plus
advanced
Completion
0%
Problems Remaining
10
Optional Problems
0
Complete the required items first, then use optional problems for extra depth.