Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 76 | Cousins in Binary Tree | Easy | TreeDepth-First SearchBreadth-First Search |
| 77 | Cousins in Binary Tree II | Medium | Hash TableTreeDepth-First Search |
| 78 | Create Binary Tree From Descriptions | Medium | ArrayHash TableTree |
| 79 | Create Components With Same Value | Hard | ArrayMathTree |
| 80 | Cycle Length Queries in a Tree | Hard | ArrayTreeBinary Tree |
| 81 | Database Query Optimizer | Hard | System DesignTreeCost Model |
| 82 | Deepest Leaves Sum | Medium | TreeDepth-First SearchBreadth-First Search |
| 83 | Delete Leaves With a Given Value | Medium | TreeDepth-First SearchBinary Tree |
| 84 | Delete Node in a BST | Medium | TreeBinary Search TreeBinary Tree |
| 85 | Delete Nodes And Return Forest | Medium | ArrayHash TableTree |
| 86 | Delete Tree Nodes | Medium | ArrayTreeDepth-First Search |
| 87 | Depth of BST Given Insertion Order | Medium | ArrayTreeBinary Search Tree |
| 88 | Design an Expression Tree With Evaluate Function | Medium | ArrayMathStack |
| 89 | Diameter of Binary Tree | Easy | TreeDepth-First SearchBinary Tree |
| 90 | Diameter of N-Ary Tree | Medium | TreeDepth-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.
