Hard Standard Problems on BST
- Construct all possible BSTs for keys 1 to N
- In-place Convert BST into a Min-Heap
- Check given array of size n can represent BST of n levels or not
- Merge two BSTs with limited extra space
- K’th Largest Element in BST when modification to BST is not allowed
- Check if given sorted sub-sequence exists in binary search tree
- Maximum Unique Element in every subarray of size K
- Count pairs from two BSTs whose sum is equal to a given value x
- Print BST keys in given Range | O(1) Space
- Inorder predecessor and successor for a given key in BST
- Find if there is a triplet in a Balanced BST that adds to zero
- Replace every element with the least greater element on its right
- Count inversions in an array | Set 2 (Using Self-Balancing BST)
- Leaf nodes from Preorder of a Binary Search Tree
- Minimum Possible value of |ai + aj – k| for given array and k.
- Special two digit numbers in a Binary Search Tree
- Merge Two Balanced Binary Search Trees
Some Quizzes:
Quick Links :
- ‘Practice Problems’ on Binary Search Tree
- Videos on Binary Search Tree
Recommended:
Binary Search Tree
A Binary Search Tree is a data structure used in computer science for organizing and storing data in a sorted manner. Each node in a Binary Search Tree has at most two children, a left child and a right child, with the left child containing values less than the parent node and the right child containing values greater than the parent node. This hierarchical structure allows for efficient searching, insertion, and deletion operations on the data stored in the tree.