Category Archives: Binary Search Tree

Given a binary search tree, and an integer X, the task is to check if there exists a pair of distinct nodes in BST with… Read More
Given a binary search tree, the task is to flatten it to a sorted list. Precisely, the value of each node must be lesser than… Read More
Given a binary search tree, the task is to flatten it to a sorted list in decreasing order. Precisely, the value of each node must… Read More
Given an integer N, the task is to count the number of possible Binary Search Trees with N keys. Examples:   Input: N = 2… Read More
Given a Binary Search Tree, the task is to find the node with maximum value. Examples:  Input:   Output: 22  Recommended: Please try your approach on… Read More
Given a Binary Search Tree with two of the nodes of the Binary Search Tree (BST) swapped. The task is to fix (or correct) the… Read More
Given a Binary Search Tree, the task is to find the node with minimum value. Examples:  Input:   Output: 4    Recommended: Please try your approach on… Read More
Given two Binary Search Trees(BST), print the elements of both BSTs in sorted form. Note: Both the BSTs will not have any common element. Examples:  Input… Read More
Given a Binary Search Tree, the task is to find the horizontal sum of the nodes that are in the same level.Examples:   Input:   Output: 6 12 24Input:   Output: 6 12 12  … Read More
Given an array of n integers where n is greater than 1, the task is to make two Binary Search Tree from the given array… Read More
Given a complete binary tree of depth H. If the mirror image from the left and the right side of this tree is taken then:  … Read More
Binary Search Tree, is a node-based binary tree data structure which has the following properties: The left subtree of a node contains only nodes with… Read More
Given a binary tree, the task is to print the maximum sum of nodes of a sub-tree which is also a Binary Search Tree.Examples:  Input… Read More
Given a binary tree, the task is to count the number of Binary Search Trees present in it. Examples:   Input:  1 / \ 2 3… Read More
Given N boxes with their capacities which denotes the total number of boxes that it can hold above it. You can stack up the boxes… Read More