## Triplet with a given sum in BST | Set 2

Given a binary search tree, and an integer X, the task is to find if there exists a triplet with sum X. Print Yes or… Read More »

## Pair with a given sum in BST | Set 2

Given a binary search tree, and an integer X, the task is to check if there exists a pair of distinct nodes in BST with… Read More »

## Flatten BST to sorted list | Increasing order

Given a binary search tree, the task is to flatten it to a sorted list. Precisely, the value of each node must be lesser than… Read More »

## Flatten BST to sorted list | Decreasing order

Given a binary search tree, the task is to flatten it to a sorted list in decreasing order. Precisely, the value of each node must… Read More »

## Total number of possible Binary Search Trees using Catalan Number

Given an integer N, the task is to count the number of possible Binary Search Trees with N keys. Examples: Input: N = 2 Output:… Read More »

## Find the node with maximum value in a Binary Search Tree using recursion

Given a Binary Search Tree, the task is to find the node with maximum value. Examples: Input: Output: 22 Recommended: Please try your approach on… Read More »

## Two nodes of a BST are swapped, correct the BST | Set-2

Given a Binary Search Tree with two of the nodes of the Binary Search Tree (BST) swapped. The task is to fix (or correct) the… Read More »

## Find the node with minimum value in a Binary Search Tree using recursion

Given a Binary Search Tree, the task is to find the node with minimum value. Examples: Input: Output: 4 Recommended: Please try your approach on… Read More »

## Merge two BSTs with constant extra space

Given two Binary Search Trees(BST), print the elements of both BSTs in sorted form. Note: Both the BSTs will not have any common element. Examples:… Read More »

## Sum of all the levels in a Binary Search Tree

Given a Binary Search Tree, the task is to find the horizontal sum of the nodes that are in the same level. Examples: Input: Output:… Read More »

## Generate two BSTs from the given array such that maximum height among them is minimum

Given an array of n integers, the task is to make two Binary Search Tree from the given array (in any order) such that the… Read More »

## Number of edges in mirror image of Complete binary tree

Given a complete binary tree of depth H. If the mirror image from the left and the right side of this tree is taken then:… Read More »

## Applications of BST

Binary Search Tree, is a node-based binary tree data structure which has the following properties: The left subtree of a node contains only nodes with… Read More »

## Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST

Given a binary tree, the task is to print the maximum sum of nodes of a sub-tree which is also a Binary Search Tree. Examples:… Read More »

## Count the Number of Binary Search Trees present in a Binary Tree

Given a binary tree, the task is to count the number of Binary Search Trees present in it. Examples: Input: 1 / \ 2 3… Read More »