Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 196 | Number Of Ways To Reconstruct A Tree | Hard | TreeGraph |
| 197 | Number of Ways to Reorder Array to Get Same BST | Hard | ArrayMathDivide and Conquer |
| 198 | Operations on Tree | Medium | ArrayHash TableTree |
| 199 | Path In Zigzag Labelled Binary Tree | Medium | MathTreeBinary Tree |
| 200 | Path Sum | Easy | TreeDepth-First SearchBreadth-First Search |
| 201 | Path Sum II | Medium | BacktrackingTreeDepth-First Search |
| 202 | Path Sum III | Medium | TreeDepth-First SearchBinary Tree |
| 203 | Path Sum IV | Medium | ArrayHash TableTree |
| 204 | Populating Next Right Pointers in Each Node | Medium | Linked ListTreeDepth-First Search |
| 205 | Populating Next Right Pointers in Each Node II | Medium | Linked ListTreeDepth-First Search |
| 206 | Print Binary Tree | Medium | TreeDepth-First SearchBreadth-First Search |
| 207 | Pseudo-Palindromic Paths in a Binary Tree | Medium | Bit ManipulationTreeDepth-First Search |
| 208 | Range Sum of BST | Easy | TreeDepth-First SearchBinary Search Tree |
| 209 | Range XOR Queries with Subarray Reversals | Hard | ArrayTreeBinary Tree |
| 210 | Reachable Nodes With Restrictions | Medium | ArrayHash TableTree |
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.
