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 »
Category Archives: Binary Search Tree
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 https://www.geeksforgeeks.org/level-order-traversal-in-spiral-form/ https://www.geeksforgeeks.org/rotate-a-matrix-by-90-degree-in-clockwise-direction-without-using-any-extra-space/ https://www.geeksforgeeks.org/design-a-data-structure-that-supports-insert-delete-search-and-getrandom-in-constant-time/ Second Round: Problem solving/Project… 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 »
Ceiling in right side for every element in an array
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 »
Find closest value for every element in array
Given an array of integers, find the closest element for every element. Examples: Input : arr[] = {10, 5, 11, 6, 20, 12} Output :… Read More »
Find closest smaller value for every element in array
Given an array of integers, find the closest smaller element for every element. If there is no smaller element then print -1 Examples: Input :… Read More »
Remove minimum elements from array so that max <= 2 * min
Given an array arr, the task is to remove minimum number of elements such that after their removal, max(arr) <= 2 * min(arr). Examples: Input:… Read More »
