# Category Archives: Binary Search Tree

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
Given an array representing preorder traversal of BST, print its postorder traversal.  Examples:  Input : 40 30 35 80 100 Output : 35 30 100… Read More
Given a binary search tree and a target node K. The task is to find the node with the minimum absolute difference with given target… Read More
Given a Binary Search Tree and a number N, the task is to find the smallest number in the binary search tree that is greater… Read More
Given a BST, the task is to find the sum of all elements greater than and equal to kth largest element. Examples:   Input : K… Read More
Given a Binary Search Tree which is also a Complete Binary Tree. The problem is to convert a given BST into a Special Max Heap… Read More
Self-Balancing Binary Search Trees are height-balanced binary search trees that automatically keep the height as small as possible when insertion and deletion operations are performed… Read More
Differences :  | set | unordered_set --------------------------------------------------------- Ordering | increasing order | no ordering | (by default) | Implementation | Self balancing BST | Hash… Read More
In this post, we will compare Red-Black Tree and AVL Tree.  Red Black Tree:  Properties: Self-Balancing is provided by painting each node with two colors(Red… Read More
Given two values n1 and n2 (where n1 < n2) and a root pointer to a Binary Search Tree. Print all the keys of tree… Read More