450 DSA Cracker
Topics (/) / BST
Serial
No. Questions
1 Find a value in a BST (https://www.geeksforgeeks.org/binary-search-tree-set-1-
search-and-insertion/)
2 Deletion of a node in a BST (https://leetcode.com/problems/delete-node-in-a-
bst/)
3 Find min and max value in a BST
(https://practice.geeksforgeeks.org/problems/minimum-element-in-bst/1)
4 Find inorder successor and inorder predecessor in a BST
(https://practice.geeksforgeeks.org/problems/predecessor-and-successor/1)
5 Check if a tree is a BST or not (https://practice.geeksforgeeks.org/problems/check-
for-bst/1)
6 Populate Inorder successor of all nodes
(https://practice.geeksforgeeks.org/problems/populate-inorder-successor-for-
all-nodes/1)
7 Find LCA of 2 nodes in a BST (https://practice.geeksforgeeks.org/problems/lowest-
common-ancestor-in-a-bst/1)
8 Construct BST from preorder traversal (https://www.geeksforgeeks.org/construct-
bst-from-given-preorder-traversa/)
9 Convert Binary tree into BST (https://practice.geeksforgeeks.org/problems/binary-
tree-to-bst/1)
10 Convert a normal BST into a Balanced BST
(https://www.geeksforgeeks.org/convert-normal-bst-balanced-bst/)
11 Merge two BST [ V.V.V>IMP ] (https://www.geeksforgeeks.org/merge-two-
balanced-binary-search-trees/)
12 Find Kth largest element in a BST
(https://practice.geeksforgeeks.org/problems/kth-largest-element-in-bst/1)
Serial
No. Questions
13 Find Kth smallest element in a BST
(https://practice.geeksforgeeks.org/problems/find-k-th-smallest-element-in-
bst/1)
14 Count pairs from 2 BST whose sum is equal to given value "X"
(https://practice.geeksforgeeks.org/problems/brothers-from-different-root/1)
15 Find the median of BST in O(n) time and O(1) space
(https://www.geeksforgeeks.org/find-median-bst-time-o1-space/)
16 Count BST ndoes that lie in a given range
(https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-
given-range/1)
17 Replace every element with the least greater element on its right
(https://www.geeksforgeeks.org/replace-every-element-with-the-least-greater-
element-on-its-right/)
18 Given "n" appointments, find the conflicting appointments
(https://www.geeksforgeeks.org/given-n-appointments-find-conflicting-
appointments/)
19 Check preorder is valid or not
(https://practice.geeksforgeeks.org/problems/preorder-to-postorder/0)
20 Check whether BST contains Dead end
(https://practice.geeksforgeeks.org/problems/check-whether-bst-contains-
dead-end/1)
21 Largest BST in a Binary Tree [ V.V.V.V.V IMP ]
(https://practice.geeksforgeeks.org/problems/largest-bst/1)
22 Flatten BST to sorted list (https://www.geeksforgeeks.org/flatten-bst-to-sorted-
list-increasing-order/)
