## Largest number less than or equal to N in BST (Iterative Approach)

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 »

- MakeMyTrip Interview Experience 2019
- Insert a node in Binary Search Tree Iteratively
- Find the node with maximum value in a Binary Search Tree
- Print all even nodes of Binary Search Tree
- Make Binary Search Tree
- Arcesium Interview Experience ( FTE On-Campus)
- Print all odd nodes of Binary Search Tree
- Check if a triplet with given sum exists in BST
- Find closest value for every element in array
- Construct a BST from given postorder traversal using Stack
- Sum and Product of minimum and maximum element of Binary Search Tree
- Double ended priority queue
- Find closest smaller value for every element in array
- Minimum number of nodes in an AVL Tree with given height
- Remove BST Keys in a given Range
- Count of pairs violating BST property
- Find closest greater value for every element in array
- Optimal sequence for AVL tree insertion (without any rotations)
- Remove minimum elements from array so that max <= 2 * min
- Closest greater or same value on left side for every element in array
- Minimum number of stacks possible using boxes of given capacities
- Ceiling in right side for every element in an array

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 and an integer K. We need to find the maximum of every segment of length K which has no duplicates in that… Read More »

In this article we will see that how to calculate number of elements which are greater than given value in AVL tree. Examples: Input :… Read More »

Prerequisites : Red – Black Trees. A left leaning Red Black Tree or (LLRB), is a variant of red black tree, which is a lot… Read More »

Given two Binary Search Trees consisting of unique positive elements, we have to check whether the two BSTs contains same set or elements or not.… 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,… 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 »

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 median of it. If no. of nodes are even: then median = ((n/2th node + (n+1)/2th node) /2 If… Read More »