Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 121 | Flip Binary Tree To Match Preorder Traversal | Medium | TreeDepth-First SearchBinary Tree |
| 122 | Flip Equivalent Binary Trees | Medium | TreeDepth-First SearchBinary Tree |
| 123 | Frog Position After T Seconds | Hard | TreeDepth-First SearchBreadth-First Search |
| 124 | Heavy-Light Decomposition | Hard | Advanced GraphsTreeSegment Tree |
| 125 | Height of Binary Tree After Subtree Removal Queries | Hard | ArrayTreeDepth-First Search |
| 126 | Height of Special Binary Tree | Medium | TreeDepth-First SearchBreadth-First Search |
| 127 | House Robber III | Medium | Dynamic ProgrammingTreeDepth-First Search |
| 128 | Increasing Order Search Tree | Easy | StackTreeDepth-First Search |
| 129 | Inorder Successor in BST | Medium | TreeDepth-First SearchBinary Search Tree |
| 130 | Inorder Successor in BST II | Medium | TreeBinary Search TreeBinary Tree |
| 131 | Insert into a Binary Search Tree | Medium | TreeBinary Search TreeBinary Tree |
| 132 | Insufficient Nodes in Root to Leaf Paths | Medium | TreeDepth-First SearchBinary Tree |
| 133 | Invert Binary Tree | Easy | TreeDepth-First SearchBreadth-First Search |
| 134 | Is Array a Preorder of Some Binary Tree | Medium | StackTreeDepth-First Search |
| 135 | K-D Tree | Hard | Advanced DSTreeMulti-dimensional |
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.
