Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 211 | Recover a Tree From Preorder Traversal | Hard | StringTreeDepth-First Search |
| 212 | Recover Binary Search Tree | Medium | TreeDepth-First SearchBinary Search Tree |
| 213 | Reverse Odd Levels of Binary Tree | Medium | TreeDepth-First SearchBreadth-First Search |
| 214 | Root Equals Sum of Children | Easy | TreeBinary Tree |
| 215 | Same Tree | Easy | TreeDepth-First SearchBreadth-First Search |
| 216 | Search in a Binary Search Tree | Easy | TreeBinary Search TreeBinary Tree |
| 217 | Second Minimum Node In a Binary Tree | Easy | TreeDepth-First SearchBinary Tree |
| 218 | Serialize and Deserialize Binary Tree | Hard | StringTreeDepth-First Search |
| 219 | Serialize and Deserialize BST | Medium | StringTreeDepth-First Search |
| 220 | Serialize and Deserialize N-ary Tree | Hard | StringTreeDepth-First Search |
| 221 | Shortest Path in a Weighted Tree | Hard | ArrayTreeDepth-First Search |
| 222 | Smallest Common Region | Medium | ArrayHash TableString |
| 223 | Smallest Missing Genetic Value in Each Subtree | Hard | Dynamic ProgrammingTreeDepth-First Search |
| 224 | Smallest String Starting From Leaf | Medium | StringBacktrackingTree |
| 225 | Smallest Subtree with all the Deepest Nodes | Medium | Hash TableTreeDepth-First Search |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
