# Category Archives: Binary Search Tree

Given a Binary search tree, the task is to implement forward iterator on it with the following functions.  curr(): returns the pointer to current element.â€¦ Read More
Given a Binary Search Tree, and a number X. The task is to find the number of distinct pairs of distinct nodes in BST withâ€¦ Read More
Given 2 Binary Search Trees, select one node from each tree such that their absolute difference is minimum possible. Assume each BST has at-least oneâ€¦ Read More
Given two Binary search trees and an integer X, the task is to find a pair of nodes, one belonging to the first BST andâ€¦ Read More
Given a binary search tree of size N > 1, the task is to find the minimum absolute difference between any two nodes. Examples:  Input:â€¦ Read More
Given a binary search tree, and an integer X, the task is to find if there exists a triplet with sum X. Print Yes orâ€¦ Read More
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 at the same level.Examples:  Input:   Output: 6 12 24Input:   Output: 6 12 12  â€¦ Read More