Coding Interview Questions

Problem Statement: You are given a BST node and a key. YOu need to find if that key exist any triplet sum in given BST. Solution We do…

Problem Statement: You are given an DLL where the nodes are sorted in ascending order. we need to construct Balanced BST in-place. In-place…

Solution The solution is very simple. For every node visited, check if the node lies in range, if yes, then increment the count. Then…

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…