Skip to content

Category Archives: Binary Search Tree

Given preorder traversal of a binary search tree, construct the BST.For example, if the given traversal is {10, 5, 1, 7, 40, 50}, then the… Read More
Given two Binary Search Tree (BSTs) and a value X, the problem is to print all pairs from both the BSTs whose sum is greater… Read More
Given a Binary Search tree and an integer K, we have to split the tree into two Balanced Binary Search Tree, where BST-1 consists of… Read More
Given an array arr[] of positive integers of size N, the task is to find the maximum product of bitonic subsequence of size 3.Bitonic Subsequence:… Read More
Given an array arr[] of the positive integers of size N, the task is to find the largest element on the left side of each… Read More
Prerequisite: Total number of possible Binary Search Trees with n keys Given an array arr[] of N integers. The task is to count the number of… Read More
Given an array arr[] of integers, the task is to remove duplicates from the given array.  Examples:  Input: arr[] = {1, 2, 3, 2, 5,… Read More
Given an array of integer arr[] and an integer k, the task is to find the median of each window of size k starting from… Read More
Given a Binary Tree, the task is to check whether the given binary tree is Binary Search Tree or not.A binary search tree (BST) is… Read More
Binary Tree Data Structure A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree… Read More
Given an array arr[] of N integers, the task is to make two binary search trees. One while traversing from the left side of the… Read More
Given a Binary Search Tree (BST) with duplicates, find the node (the most frequently occurred element) in the given BST. If the BST contains two… Read More
In Bottom-Up insertion of Red-Black Trees, “simple” Binary Search Tree insertion is used, followed by correction of the RB-Tree Violations on the way back up… Read More
Given an array of values. The task is to implement a Binary Search Tree using values of the array where every node stores the maximum… Read More
Consider a BST(Binary Search Tree) where duplicates are not allowed.Given a key present in the BST. The task is to find its pre-order successor in… Read More