ProDeveloperTutorial

Problem Statement: You are given the root node of BST and 2 key elements. You need to find the distance between the 2 nodes. Solution So as…

Problem Statement: You are given a root of BST and 2 values. You need to return the sum of the nodes that falls within the range. Solution For…

Problem Statement: You are given BST and a kth element in the given tree. Then you need to give the kth smallest element. Solution Solution is…

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…

Problem Statement: You are given two balanced BST, you need to merge the two given balanced BST. Solution THe solution is very simple. WKT…

 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…

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…

Problem Statement: You are given an array representing a preorder traversal of a Binary Search Tree and construct the BST. Solution WKT the…

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…

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…