Given a Binary search Tree that contains positive integer values greater than 0. The task is to check whether the BST contains a dead end… Read More

# Category Archives: Binary Search Tree

Given a binary search tree and a target node K. The task is to find the node with minimum absolute difference with given target value… Read More

Given two Binary Search Trees (BST) and a given sum. The task is to find pairs with given sum such that each pair elements must… Read More

Given a binary search tree and a sorted sub-sequence. the task is to check if the given sorted sub-sequence exist in binary search tree or… Read More

Panel 1 Tell me about yourself. How many interviews did you attend? Reasons for your rejection in the interviews? How did you deal with those… Read More

Accolite visited our campus. There was a Pre-Placemant talk before Round 1. Round 1 MCQ (20 Qus)- 30 Mins 72 people selected in 640 students.… Read More

Given an array of integers, replace every element with the least greater element on its right side in the array. If there are no greater… Read More

Online Round: 2 Programming questions for 2 Hours Convert set of strings in number as given on phone keypad. String will contain only lower case… Read More

Given a Binary Search Tree, convert it into a Min-Heap containing the same elements in O(n) time. Do this in-place. Input: Binary Search Tree 8… Read More

Given a BST (Binary Search Tree) that may be unbalanced, convert it into a balanced BST that has minimum possible height. Examples : Input: 30… Read More

Given postorder traversal of a binary search tree, construct the BST. For example, if the given traversal is {1, 7, 5, 50, 40, 10}, then… Read More

Recently, VMWare has visited our campus for hiring interns and they have put a CGPA cut off of 7/10. There were 2 rounds in total.… Read More

We have discussed Overview of Array, Linked List, Queue and Stack. In this article following Data Structures are discussed. 5. Binary Tree 6. Binary Search Tree 7.… Read More

Inversion Count for an array indicates – how far (or close) the array is from being sorted. If an array is already sorted then the… Read More

Given an array of numbers, return true if given array can represent preorder traversal of a Binary Search Tree, else return false. Expected time complexity… Read More