## Check if two given key sequences construct same BSTs

Given two arrays which represent two sequences of keys that are used to create BSTs. Imagine we make a Binary Search Tree (BST) from each… Read More »

- Count the Number of Binary Search Trees present in a Binary Tree
- Make Binary Search Tree
- Total number of possible Binary Search Trees using Catalan Number
- Two nodes of a BST are swapped, correct the BST | Set-2
- Find the node with maximum value in a Binary Search Tree using recursion
- Applications of BST
- Merge two BSTs with constant extra space
- 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
- 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 pairs with a given sum in a Binary Search Tree
- Implementing Forward Iterator in BST
- Number of edges in mirror image of Complete binary tree
- 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 two arrays which represent two sequences of keys that are used to create BSTs. Imagine we make a Binary Search Tree (BST) from each… Read More »

Given a BST and a number. The task is to check whether the given number is equal to the sum of all the node from… Read More »

Given a BST and a key Node, find the total sum in BST, except those Node which are adjacent to key Node. Examples: Recommended: Please… Read More »

Given a preorder traversal of a BST. The task is to find the number of elements less than root. Examples: Input: preorder[] = {3, 2,… Read More »

Consider a problem where same elements are likely to be searched again and again. Implement search operation efficiently. Examples : Input : arr[] = {12… Read More »

Given an array of positive and negative integers and an integer K. The task is to find the subarray which has its sum closest to… Read More »

Given an array of distinct elements, print the closest greater element for every element. The closest greater element for an element x is the smallest… Read More »

Given a Binary Search Tree and a number x, find floor of x in the given BST. Input : x = 14 and root of… Read More »

Online Round: This round was held on Hackerrank for 1:30 hrs. There were two questions in this round. A tree was given with upto 10^5 nodes.… Read More »

Nutanix Technologies came to our campus BITS Goa for On-Campus Recruitment process. They conducted multiple rounds of screening to finally select 3 Candidates. Online Test:… Read More »

Given a binary search tree and a number N, the task is to find the sum of the cousins of the given node N if… Read More »

Round: I An Array arr={7, 7, 8, 8, 9, 1, 1, 4, 2, 2} has numbers appearing twice or once. Duplicates appear side by side… Read More »

Round 1: Round 1 was for 200 marks. 25 MCQs and 2 coding questions .The MCQs were mostly on aptitude and some were Technical (C++… Read More »

There were a total of 3 rounds. 1st was online coding, 2nd was written coding and last round was divided in three parts, basically 3… Read More »

Given a BST and a key. The task is to find the inorder successor and predecessor of the given key. In case, if either of… Read More »