Back to Topics
BST
22 questions in this topic
| # | Status | Problem | Difficulty | Marks | Save | Notes | Revision |
|---|---|---|---|---|---|---|---|
| 1 |
Find a value in a BST
|
Medium | 0 | ||||
| 2 |
Deletion of a node in a BST
|
Medium | 0 | ||||
| 3 |
Find min and max value in a BST
|
Medium | 0 | ||||
| 4 |
Find inorder successor and inorder predecessor in a BST
|
Medium | 0 | ||||
| 5 |
Check if a tree is a BST or not
|
Medium | 0 | ||||
| 6 |
Populate Inorder successor of all nodes
|
Medium | 0 | ||||
| 7 |
Find LCA of 2 nodes in a BST
|
Medium | 0 | ||||
| 8 |
Construct BST from preorder traversal
|
Medium | 0 | ||||
| 9 |
Convert Binary tree into BST
|
Medium | 0 | ||||
| 10 |
Convert a normal BST into a Balanced BST
|
Medium | 0 | ||||
| 11 |
Merge two BST [ V.V.V>IMP ]
|
Medium | 0 | ||||
| 12 |
Find Kth largest element in a BST
|
Medium | 0 | ||||
| 13 |
Find Kth smallest element in a BST
|
Medium | 0 | ||||
| 14 |
Count pairs from 2 BST whose sum is equal to given value "X"
|
Medium | 0 | ||||
| 15 |
Find the median of BST in O(n) time and O(1) space
|
Hard | 0 | ||||
| 16 |
Count BST nodes that lie in a given range
|
Medium | 0 | ||||
| 17 |
Replace every element with the least greater element on its right
|
Medium | 0 | ||||
| 18 |
Given "n" appointments, find the conflicting appointments
|
Medium | 0 | ||||
| 19 |
Check preorder is valid or not
|
Medium | 0 | ||||
| 20 |
Check whether BST contains Dead end
|
Medium | 0 | ||||
| 21 |
Largest BST in a Binary Tree [ V.V.V.V.V IMP ]
|
Hard | 0 | ||||
| 22 |
Flatten BST to sorted list
|
Medium | 0 |