Skip to content

Category Archives: Binary Search Tree

Binary Tree Data Structure  A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree… Read More
Given an array arr[] of N integers, the task is to make two binary search trees. One while traversing from the left side of the… Read More
Given a Binary Search Tree (BST) with duplicates, find the node (the most frequently occurred element) in the given BST. If the BST contains two… Read More
In Bottom-Up insertion of Red-Black Trees, “simple” Binary Search Tree insertion is used, followed by correction of the RB-Tree Violations on the way back up… Read More
Given an array of values. The task is to implement a Binary Search Tree using values of the array where every node stores the maximum… Read More
Consider a BST(Binary Search Tree) where duplicates are not allowed.Given a key present in the BST. The task is to find its pre-order successor in… Read More
Given a directed graph with N vertices and M edges that may contain cycles, the task is to find the lexicographically smallest topological ordering of… Read More
Given a Binary Search Tree (BST), the task is to print the BST in min-max fashion. What is min-max fashion? A min-max fashion means you have to… Read More
Given a Binary search tree, the task is to implement backward iterator on it with the following functions.  curr(): returns the pointer to current element.… Read More
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

Start Your Coding Journey Now!