Practice problems across 75+ categories
Practice problems frequently asked at Binary Search Tree • 40 problems | 9 Easy | 27 Medium | 3 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 1 | All Elements in Two Binary Search Trees | Medium | TreeDepth-First SearchBinary Search Tree |
| 2 | Balance a Binary Search Tree | Medium | Divide and ConquerGreedyTree |
| 3 | Binary Search Tree Iterator | Medium | StackTreeDesign |
| 4 | Binary Search Tree Iterator II | Medium | StackTreeDesign |
| 5 | Binary Search Tree to Greater Sum Tree | Medium | TreeDepth-First SearchBinary Search Tree |
| 6 | Closest Binary Search Tree Value | Easy | Binary SearchTreeDepth-First Search |
| 7 | Closest Binary Search Tree Value II | Hard | Two PointersStackTree |
| 8 | Closest Nodes Queries in a Binary Search Tree | Medium | ArrayBinary SearchTree |
| 9 | Construct Binary Search Tree from Preorder Traversal | Medium | ArrayStackTree |
| 10 | Convert Binary Search Tree to Sorted Doubly Linked List | Medium | Linked ListStackTree |
| 11 | Convert BST to Greater Tree | Medium | TreeDepth-First SearchBinary Search Tree |
| 12 | Convert Sorted Array to Binary Search Tree | Easy | ArrayDivide and ConquerTree |
| 13 | Convert Sorted List to Binary Search Tree | Medium | Linked ListDivide and ConquerTree |
| 14 | Delete Node in a BST | Medium | TreeBinary Search TreeBinary Tree |
| 15 | Depth of BST Given Insertion Order | Medium | ArrayTreeBinary Search 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.
