Binary Search Trees: Kth Largest Element in a BST
Problem Statement: You are given BST and a kth element in the given tree. Then you need to give the kth largest element. Solution Here we need…
Binary Search Trees: Merge Two balanced BST
Problem Statement: You are given two balanced BST, you need to merge the two given balanced BST. Solution THe solution is very simple. WKT…
Binary Search Trees: Convert a normal BST into a Balanced BST
Problem Statement: You are given a BST root node, you need to make it as a balanced BST. Example Input: 3 / 2 / 1 Output: 2 / \ 1 3 Solution…
Binary Search Trees: Convert Binary Tree into Binary Search Tree.
Example Input: 11 / \ 3 8 / \ 9 5 Output: 9 / \ 5 11 / \ 3 8 Solution The solution is simple: 1. Take the node values into an temp array by…
Binary Search Trees: Construct BST from preorder traversal
Problem Statement: You are given an array representing a preorder traversal of a Binary Search Tree and construct the BST. Solution WKT the…
Binary Search Trees: LCA in a BST
Problem Statement: You are given a BST root node and 2 node values n1 and n2, you need to find the Lowest Common Ancestor. Solution As we know…
Binary Search Trees: Convert a BST into greater sum tree
Problem Statement: You are given a root node of BST. You need to convert into a greater sum tree. Example Input: 4 / \ 3 6 Output: 6 / \ 10 0…
Binary Search Trees: A program to check if a binary tree is BST or not
Problem Statement: You are given a root node of a binary tree. You need to find out if a binary tree is a BST or not. Solution BST will have…
Binary Search Trees: Find the Inorder predecessor and successor for a given key in BST
Problem Statement: You are given BST root and a key, find the inorder predecessor and successor for that key. If the key is not found, then…
Binary Search Trees: Find min and max value in a BST
Problem Statement: You are given a BST root node, you need to find the max and min value. Solution To get the min value, traverse the node…