## Implementing Backward Iterator in BST

Given a Binary search tree, the task is to implement backward iterator on it with the following functions. curr(): returns the pointer to current element.… Read More »

- Count the Number of Binary Search Trees present in a Binary Tree
- Make Binary Search Tree
- Arcesium Interview Experience ( FTE On-Campus)
- Total number of possible Binary Search Trees using Catalan Number
- Find the node with maximum value in a Binary Search Tree using recursion
- Two nodes of a BST are swapped, correct the BST | Set-2
- Applications of BST
- Sum of all the levels in a Binary Search Tree
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Merge two BSTs with constant extra space
- Pair with a given sum in BST | Set 2
- Find the node with minimum value in a Binary Search Tree using recursion
- Generate two BSTs from the given array such that maximum height among them is minimum
- Minimum number of stacks possible using boxes of given capacities
- Number of edges in mirror image of Complete binary tree
- Number of pairs with a given sum in a Binary Search Tree
- Implementing Forward Iterator in BST
- Nodes from given two BSTs with sum equal to X
- Triplet with a given sum in BST | Set 2
- Pair with minimum absolute difference | BST
- Implementing Backward Iterator in BST
- Flatten BST to sorted list | Increasing order
- Find the minimum absolute difference in two different BST's
- Flatten BST to sorted list | Decreasing order

Given a Binary search tree, the task is to implement backward iterator on it with the following functions. curr(): returns the pointer to current element.… Read More »

Given a Binary search tree, the task is to implement forward iterator on it with the following functions. curr(): returns the pointer to current element.… Read More »

Given a Binary Search Tree, and a number X. The task is to find the number of distinct pairs of distinct nodes in BST with… Read More »

Given 2 Binary Search Trees, select one node from each tree such that their absolute difference is minimum possible. Assume each BST has at-least one… Read More »

Given two Binary search trees and an integer X, the task is to find a pair of nodes, one belonging to the first BST and… Read More »

Given a binary search tree of size N > 1, the task is to find the minimum absolute difference between any two nodes. Examples: Input:… Read More »

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 »

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 »