Check if a triplet with given sum exists in BST
Given a Binary Search Tree and a SUM. The task is to check if there exists any triplet(group of 3 elements) in the given BST… Read More »
Category Archives: Binary Search Tree
Print all odd nodes of Binary Search Tree
Given a binary search tree. The task is to print all odd nodes of the binary search tree. Examples: Input : 5 / \ 3… Read More »
Ceiling in right side for every element in an array
Given an array of integers, find the closest greater element for every element. If there is no greater element then print -1 Examples: Input :… Read More »
Find closest value for every element in array
Given an array of integers, find the closest element for every element. Examples: Input : arr[] = {10, 5, 11, 6, 20, 12} Output :… Read More »
Find closest smaller value for every element in array
Given an array of integers, find the closest smaller element for every element. If there is no smaller element then print -1 Examples: Input :… Read More »
Remove minimum elements from array so that max <= 2 * min
Given an array arr, the task is to remove minimum number of elements such that after their removal, max(arr) <= 2 * min(arr). Examples: Input:… Read More »
Find closest greater value for every element in array
Given an array of integers, find the closest greater element for every element. If there is no greater element then print -1 Examples: Input :… Read More »
Closest greater or same value on left side for every element in array
Given an array of integers, find the closest (not considering distance, but value) greater or same value on left of every element. If an element… Read More »
Double ended priority queue
A double ended priority queue supports operations of both max heap (a max priority queue) and min heap (a min priority queue). The following operations… Read More »
Find the node with maximum value in a Binary Search Tree
Given a Binary Search Tree, the task is to find the node with the maximum value in a BST. For the above tree, we start… Read More »
Sum and Product of minimum and maximum element of Binary Search Tree
Given a Binary Search Tree. The task is to find the sum and product of maximum and minimum value of tree. For the above tree,… Read More »
Optimal sequence for AVL tree insertion (without any rotations)
Given an array of integers, the task is to find the sequence in which these integers should be added to an AVL tree such that… Read More »
Minimum number of nodes in an AVL Tree with given height
Given the height of an AVL tree ‘h’, the task is to find the minimum number of nodes the tree can have. Examples : Input… Read More »
Print all even nodes of Binary Search Tree
Given a binary search tree. The task is to print all even nodes of the binary search tree. Examples: Input : 5 / \ 3… Read More »
Remove BST Keys in a given Range
Given a Binary Search Tree (BST) and a range [min, max], remove all keys which are inside the given range. The modified tree should also… Read More »