## 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 »

- Two nodes of a BST are swapped, correct the BST | Set-2
- Total number of possible Binary Search Trees using Catalan Number
- Merge two BSTs with constant extra space
- Find the node with maximum value in a Binary Search Tree using recursion
- Lexicographically Smallest Topological Ordering
- Sum of all the levels in a Binary Search Tree
- Pair with a given sum in BST | Set 2
- Find the node with minimum value in a Binary Search Tree using recursion
- Number of pairs with a given sum in a Binary Search Tree
- Implementing Forward Iterator in BST
- Print Binary Search Tree in Min Max Fashion
- Generate two BSTs from the given array such that maximum height among them is minimum
- Pair with minimum absolute difference | BST
- Triplet with a given sum in BST | Set 2
- Nodes from given two BSTs with sum equal to X
- Implementing a BST where every node stores the maximum number of nodes in the path till any leaf
- Red-Black Trees | Top-Down Insertion
- Number of edges in mirror image of Complete binary tree
- Flatten BST to sorted list | Increasing order
- Implementing Backward Iterator in BST
- Pre-Order Successor of all nodes in Binary Search Tree
- Find the minimum absolute difference in two different BST's
- Find maximum count of duplicate nodes in a Binary Search Tree
- Flatten BST to sorted list | Decreasing order

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

Given N boxes with their capacities which denotes the total number of boxes that it can hold above it. You can stack up the boxes… Read More »