# Category Archives: Binary Search Tree

Given a Binary Tree, convert it to a Binary Search Tree. The conversion must be done in such a way that keeps the original structure… Read More
Given a stream of integers, lookup the rank of a given integer x. Rank of an integer in-stream is “Total number of elements less than… Read More
Given an array of size n, the task is to find whether array can represent a BST with n levels. Since levels are n, we… Read More
Given a Binary Search Tree that contains positive integer values greater than 0. The task is to check whether the BST contains a dead end… Read More
Given a BST and a sum, find if there is a pair with given sum. Example: Input : sum = 28 Root of below tree… Read More
Round 1: The first round consisted of two coding questions to be solved in 1 hr – Given a binary tree, print the boundary of… Read More
Given a binary search tree and a key. Check the given key exist in BST or not without recursion. Recommended: Please try your approach on… Read More
We have a binary search tree and a number N. Our task is to find the greatest number in the binary search tree that is… Read More
Given an array and an integer K. We need to find the maximum of every segment of length K which has no duplicates in that… Read More
In this article we will see that how to calculate number of elements which are greater than given value in AVL tree. Examples: Input :… Read More
Prerequisites : Red – Black Trees. A left leaning Red Black Tree or (LLRB), is a variant of red black tree, which is a lot… Read More
Given two Binary Search Trees consisting of unique positive elements, we have to check whether the two BSTs contains same set or elements or not.… Read More
You are given an array of n integer and an integer K. Find the number of total unordered pairs {i, j} such that absolute value… Read More
Given a Binary Search Tree and two keys in it. Find the distance between two nodes with given two keys. It may be assumed that… Read More
Construct the BST (Binary Search Tree) from its given level order traversal. Examples: Input : arr[] = {7, 4, 12, 3, 6, 8, 1, 5,… Read More