Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 31 | Build Binary Expression Tree From Infix Expression | Hard | StringStackTree |
| 32 | Cartesian Tree Builder | Hard | Advanced DSTreeStack |
| 33 | Centroid Decomposition | Hard | Advanced GraphsTreeDecomposition |
| 34 | Change the Root of a Binary Tree | Medium | TreeDepth-First SearchBinary Tree |
| 35 | Check Completeness of a Binary Tree | Medium | TreeBreadth-First SearchBinary Tree |
| 36 | Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree | Medium | TreeDepth-First SearchBreadth-First Search |
| 37 | Check if DFS Strings Are Palindromes | Hard | ArrayHash TableString |
| 38 | Check If Two Expression Trees are Equivalent | Medium | Hash TableTreeDepth-First Search |
| 39 | Choose Edges to Maximize Score in a Tree | Medium | Dynamic ProgrammingTreeDepth-First Search |
| 40 | Clone Binary Tree With Random Pointer | Medium | Hash TableTreeDepth-First Search |
| 41 | Clone N-ary Tree | Medium | Hash TableTreeDepth-First Search |
| 42 | Closest Binary Search Tree Value | Easy | Binary SearchTreeDepth-First Search |
| 43 | Closest Binary Search Tree Value II | Hard | Two PointersStackTree |
| 44 | Closest Leaf in a Binary Tree | Medium | TreeDepth-First SearchBreadth-First Search |
| 45 | Closest Node to Path in Tree | Hard | ArrayTreeDepth-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.
