Given an array arr[] consisting of N positive integers and an integer K, the task is to find the minimum possible array sum that can… Read More »
Given a Binary Search Tree, the task is to print the nodes of the BST in the following order: If the BST contains levels numbered… Read More »
Given an array, arr[] of size N consisting of elements from the range [1, N], that represents the order, in which the elements are inserted… Read More »
Data Structure is the way of storing data in computer’s memory so that it can be used easily and efficiently. There are different data-structures used… Read More »
Given an array A[ ] consisting of N distinct integers, the task is to find the number of elements which are strictly greater than all… Read More »
Given an array A[] consisting of N numbers denoting the values written on N steps, the task is to find the alpha score of the… Read More »
Given a Perfect BST with N nodes and an integer K, the task is to find the Kth smallest element is present in the tree.… Read More »
Given a string S of length N, and Q queries of the following type: Type 1: 1 i X Update the i-th character of the… Read More »
Given a Binary Tree and a positive integer K. The task is to check whether the Balanced BST of size K exists in a given… Read More »
Given a binary search tree and a node of the binary search tree, the task is to delete the node from the Binary Search tree… Read More »
Prerequisites: Binary Tree to Doubly Linked ListGiven a Binary Tree, the task is to create a Balanced Binary Tree from all the leaf nodes of… Read More »
Given a Binary Search Tree and a binary integer K, the task is to convert Binary search tree into a Skewed Tree in increasing order… Read More »
Given preorder traversal of a binary search tree, construct the BST. For example, if the given traversal is {10, 5, 1, 7, 40, 50}, then… Read More »
Given two Binary Search Tree (BSTs) and a value X, the problem is to print all pairs from both the BSTs whose sum is greater… Read More »
Given a Binary Search tree and an integer K, we have to split the tree into two Balanced Binary Search Tree, where BST-1 consists of… Read More »
