Count nodes in a BST that lies within a given range
Given a BST, count the total number of nodes that lie within a given range.
Category: BST
In-place merge two height-balanced BSTs
Given two height-balanced binary search trees, in-place merge them into a single balanced binary search tree. For each node of a height-balanced tree, the difference between its left and right subtree height is at most 1.
Determine whether a BST is skewed from its preorder traversal
Given an array representing the preorder traversal of a BST, determine whether it represents a skewed BST or not. In a skewed BST, each node’s descendants are either smaller or larger than the node itself.
Print complete Binary Search Tree (BST) in increasing order
Given a level order representation of a complete binary search tree, print its elements in increasing order.
Convert a Binary Search Tree into a Min Heap
Given a binary search tree (BST), efficiently convert it into a min-heap. In order words, convert a binary search tree into a complete binary tree where each node has a higher value than its parent’s value.
Find a triplet with the given sum in a BST
Given a binary search tree, find a triplet with a given sum present in it.
Merge two BSTs into a doubly-linked list in sorted order
Given two binary search trees, merge them into a doubly-linked list in sorted order.
Construct a height-balanced BST from an unbalanced BST
Given a binary search tree (BST), convert it into a height-balanced binary search tree. For a height-balanced binary search tree, the difference between the height of the left and right subtree of every node is never more than 1.
Find the size of the largest BST in a binary tree
Given a binary tree, find the size of the largest BST (Binary Search Tree) in it.
Check if a given sequence represents the preorder traversal of a BST
Given a distinct sequence of keys, check if it can represent a preorder traversal of a binary search tree (BST).
Count subtrees in a BST whose nodes lie within a given range
Given a BST, count subtrees in it whose nodes lie within a given range.
Build a Binary Search Tree from a postorder sequence
Given a distinct sequence of keys representing the postorder traversal of a binary search tree, construct a BST from it.