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

# Category Archives: Binary Search Tree

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: Input… 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

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

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

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

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

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

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

Given an array of integers, find the closest greater element for every element. If there is no greater element then print -1 Examples: Input :… Read More

Given an array of integers, find the closest element for every element. Examples: Input : arr[] = {10, 5, 11, 6, 20, 12} Output :… Read More