Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 46 | Closest Nodes Queries in a Binary Search Tree | Medium | ArrayBinary SearchTree |
| 47 | Collect Coins in a Tree | Hard | ArrayTreeGraph |
| 48 | Complete Binary Tree Inserter | Medium | TreeBreadth-First SearchDesign |
| 49 | Compression Algorithm | Hard | System DesignHuffmanTree |
| 50 | Construct Binary Search Tree from Preorder Traversal | Medium | ArrayStackTree |
| 51 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 52 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 53 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 54 | Construct Binary Tree from String | Medium | StringStackTree |
| 55 | Construct Quad Tree | Medium | ArrayDivide and ConquerTree |
| 56 | Construct String from Binary Tree | Medium | StringTreeDepth-First Search |
| 57 | Convert Binary Search Tree to Sorted Doubly Linked List | Medium | Linked ListStackTree |
| 58 | Convert BST to Greater Tree | Medium | TreeDepth-First SearchBinary Search Tree |
| 59 | Convert Sorted Array to Binary Search Tree | Easy | ArrayDivide and ConquerTree |
| 60 | Convert Sorted List to Binary Search Tree | Medium | Linked ListDivide and ConquerTree |
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.
