Given a matrix mat[][] and an integer K, the task is to find the length of the shortest path in a matrix from top-left to… Read More

# Category Archives: Binary Search Tree

AVL Tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for… Read More

Given a Binary Search Tree consisting of N distinct nodes, the task is to flatten the given Binary Search Tree to convert the tree into… Read More

Given a Binary Search Tree, the task is to create a wave array from the given Binary Search Tree. An array arr[0..n-1] is called a… Read More

Given a Binary Search Tree, a target node in the BST, and an integer value K, the task is to find the sum of all… Read More

Given a world map in the form of Generic M-ary Tree consisting of N nodes and an array queries[], the task is to implement the… Read More

A Set is a collection of distinct elements. Elements cannot be modified once added. There are various operations associated with sets such as union, intersection,… Read More

AVL Trees are self-balancing Binary Search Trees where the difference between heights of left and right subtrees cannot be more than one for all nodes.… Read More

Given an array arr[] consisting of N distinct integers, the task is to print for each array element, all the greater elements present on its… Read More

Given a Binary Search Tree (BST)consisting of N nodes and two nodes A and B, the task is to find the median of all the… Read More

Given a positive integer H, the task is to find the number of possible Binary Search Trees of height H consisting of the first (H… Read More

Given a Binary Tree of positive integers. The task is to convert it to a BST using left shift operations on the digits of the… Read More

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