Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 76 | Cycle Length Queries in a Tree | Hard | ArrayTreeBinary Tree |
| 77 | Deepest Leaves Sum | Medium | TreeDepth-First SearchBreadth-First Search |
| 78 | Delete Leaves With a Given Value | Medium | TreeDepth-First SearchBinary Tree |
| 79 | Delete Node in a BST | Medium | TreeBinary Search TreeBinary Tree |
| 80 | Delete Nodes And Return Forest | Medium | ArrayHash TableTree |
| 81 | Delete Tree Nodes | Medium | ArrayTreeDepth-First Search |
| 82 | Depth of BST Given Insertion Order | Medium | ArrayTreeBinary Search Tree |
| 83 | Design an Expression Tree With Evaluate Function | Medium | ArrayMathStack |
| 84 | Diameter of Binary Tree | Easy | TreeDepth-First SearchBinary Tree |
| 85 | Diameter of N-Ary Tree | Medium | TreeDepth-First Search |
| 86 | Difference Between Maximum and Minimum Price Sum | Hard | ArrayDynamic ProgrammingTree |
| 87 | Distribute Coins in Binary Tree | Medium | TreeDepth-First SearchBinary Tree |
| 88 | Employee Importance | Medium | ArrayHash TableTree |
| 89 | Encode N-ary Tree to Binary Tree | Hard | TreeDepth-First SearchBreadth-First Search |
| 90 | Equal Tree Partition | Medium | TreeDepth-First SearchBinary Tree |
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.
