Binary Search Tree | Set 3 (Iterative Delete)
Given a binary search tree and a node of the binary search tree, the task is to delete the node from the Binary Search tree… Read More »
Category Archives: Binary Search Tree
Create Balanced Binary Tree using its Leaf Nodes without using extra space
Prerequisites: Binary Tree to Doubly Linked List Given a Binary Tree, the task is create a Balanced Binary Tree from all the leaf nodes of… Read More »
Convert a Binary Search Tree into a Skewed tree in increasing or decreasing order
Given a Binary Search Tree and a binary integer K, the task is to convert Binary search tree into a Skewed Tree in increasing order… Read More »
Construct BST from given preorder traversal | Set 3 (Naive Method)
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… Read More »
Print all pairs from two BSTs whose sum is greater than the given value
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 »
Split a BST into two balanced BSTs based on a value K
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 »
Maximum product of bitonic subsequence of size 3
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… Read More »
Largest element smaller than current element on left for every element in Array
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 »
Total number of BSTs using array elements
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… Read More »
Duplicates Removal in Array using BST
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 »
Median of sliding window in an array
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 »
Check if a Binary Tree is BST : Simple and Efficient Approach
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)… Read More »
Difference between Binary Tree and Binary Search Tree
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 »
Maximum height of the binary search tree created from the given array
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 »
Find maximum count of duplicate nodes in a Binary Search Tree
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 »
