Problems
Binary Search Tree
Choose difficulty level to view problems.
0%
Mastery
Binary Search Tree Progress
0
/ 28
Questions Solved in Binary Search Tree
Easy
0
/ 9
Medium
0
/ 12
Hard
0
/ 7
| # | Problem | Status | Practice On Practice | Companies |
|---|---|---|---|---|
| 1 |
|
Search in a Binary Search Tree · 6 Companies
|
||
| 2 |
|
Convert Sorted Array to Binary Search Tree · 7 Companies
|
||
| 3 |
|
Range Sum of BST · 5 Companies
|
||
| 4 |
|
Minimum Absolute Difference in BST · 5 Companies
|
||
| 5 |
|
Two Sum IV - Input is a BST · 5 Companies
|
||
| 6 |
|
Find Mode in Binary Search Tree · 5 Companies
|
||
| 7 |
|
Increasing Order Search Tree · 5 Companies
|
||
| 8 |
|
|
Find The Closest Element In Bst · 4 Companies
|
|
| 9 |
|
Insert into a Binary Search Tree · 5 Companies
|
||
| 10 |
|
|
Largest Bst · 4 Companies
|
|
| 11 |
|
|
Find The Closest Binary Search Tree Value Ii · 4 Companies
|
|
| 12 |
|
Maximum Sum BST in Binary Tree · 4 Companies
|
||
| 13 |
|
Serialize and Deserialize BST · 5 Companies
|
||
| 14 |
|
|
Binary Tree To Dll · 5 Companies
|
|
| 15 |
|
|
Find A Pair With Given Target In Bst · 5 Companies
|
|
| 16 |
|
|
Merge Two Bst S · 5 Companies
|
|
| 17 |
|
Validate Binary Search Tree · 10 Companies
|
||
| 18 |
|
Kth Smallest Element in a BST · 7 Companies
|
||
| 19 |
|
Lowest Common Ancestor of a Binary Search Tree · 7 Companies
|
||
| 20 |
|
Binary Search Tree Iterator · 6 Companies
|
||
| 21 |
|
Trim a Binary Search Tree · 5 Companies
|
||
| 22 |
|
Delete Node in a BST · 5 Companies
|
||
| 23 |
|
Convert Sorted List to Binary Search Tree · 6 Companies
|
||
| 24 |
|
Construct Binary Search Tree from Preorder Traversal · 4 Companies
|
||
| 25 |
|
|
Predecessor And Successor · 4 Companies
|
|
| 26 |
|
Binary Search Tree to Greater Sum Tree · 3 Companies
|
||
| 27 |
|
Balance a Binary Search Tree · 5 Companies
|
||
| 28 |
|
|
Preorder Traversal And Bst · 4 Companies
|
