Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 46 | Construct Binary Search Tree from Preorder Traversal | Medium | ArrayStackTree |
| 47 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 48 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 49 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 50 | Construct Binary Tree from String | Medium | StringStackTree |
| 51 | Construct Quad Tree | Medium | ArrayDivide and ConquerTree |
| 52 | Construct String from Binary Tree | Medium | StringTreeDepth-First Search |
| 53 | Convert Binary Search Tree to Sorted Doubly Linked List | Medium | Linked ListStackTree |
| 54 | Convert BST to Greater Tree | Medium | TreeDepth-First SearchBinary Search Tree |
| 55 | Convert Sorted Array to Binary Search Tree | Easy | ArrayDivide and ConquerTree |
| 56 | Convert Sorted List to Binary Search Tree | Medium | Linked ListDivide and ConquerTree |
| 57 | Correct a Binary Tree | Medium | Hash TableTreeDepth-First Search |
| 58 | Count Complete Tree Nodes | Easy | Binary SearchBit ManipulationTree |
| 59 | Count Good Nodes in Binary Tree | Medium | TreeDepth-First SearchBreadth-First Search |
| 60 | Count Nodes Equal to Average of Subtree | 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.
