# Category Archives: Binary Search Tree

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

## Minimum number of stacks possible using boxes of given capacities

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 »

## Make Binary Search Tree

Given an array arr[] of size N. The task is to find whether it is possible to make Binary Search Tree with the given array… Read More »

## Arcesium Interview Experience ( FTE On-Campus)

The whole process was online. All the interviews were help via HackerRank CodePair Platform in our TPC office since they did not visit the campus.… Read More »

## MakeMyTrip Interview Experience 2019

I applied for SSE position (Gurgaon Location) There were three rounds.. First round: Data Structures And Problem solving Level order traversal in spiral form Rotate… Read More »

## Count of pairs violating BST property

Given a Binary tree and number of nodes in the tree, the task is to find the number of pairs violating the BST property. Binary… Read More »

## Check if a triplet with given sum exists in BST

Given a Binary Search Tree and a SUM. The task is to check if there exists any triplet(group of 3 elements) in the given BST… Read More »

## Print all odd nodes of Binary Search Tree

Given a binary search tree. The task is to print all odd nodes of the binary search tree. Examples: Input : 5 / \ 3… Read More »