Prerequisites : Red – Black Trees.A left leaning Red Black Tree or (LLRB), is a variant of red black tree, which is a lot easier… Read More
Category Archives: Binary Search Tree
Given two Binary Search Trees consisting of unique positive elements, we have to check whether the two BSTs contain the same set of elements or… Read More
You are given an array of n integer and an integer K. Find the number of total unordered pairs {i, j} such that absolute value… Read More
Given a Binary Search Tree and two keys in it. Find the distance between two nodes with given two keys. It may be assumed that… Read More
Construct the BST (Binary Search Tree) from its given level order traversal. Examples: Input: arr[] = {7, 4, 12, 3, 6, 8, 1, 5, 10}Output:… Read More
Given two BSTs containing n1 and n2 distinct nodes respectively. Given a value x. The problem is to count all pairs from both the BSTs… Read More
We have given a binary search tree and we want to delete the leaf nodes from the binary search tree. Examples: Input : 20 10… Read More
Qualcomm visited for both Full time and Internship profiles for both hardware as well as software profiles. Round 1 1st Round was an online MCQ… Read More
We have a binary search tree and a number N. Our task is to find the greatest number in the binary search tree that is… Read More
Given an array of N element. The task is to check if it is Inorder traversal of any Binary Search Tree or not. Print “Yes”… Read More
Given a binary search tree which is also a complete binary tree. The problem is to convert the given BST into a Min Heap with… Read More
Given a Binary Search Tree, find the median of it. If number of nodes are even: then median = ((n/2th node + ((n)/2th+1) node) /2 … Read More
Given a Preorder traversal of a Binary Search Tree. The task is to print leaf nodes of the Binary Search Tree from the given preorder.… Read More
A threaded binary tree node looks like following. C++ struct Node { struct Node *left, *right; int info; // false if left pointer points… Read More
Vmware conducted their online exam via hirepro. Round 1 : There were 3 sections quants, Technical questions and OOPs based questions, no section had negative… Read More
