Inorder predecessor and successor for a given key in BST | Iterative Approach
Given a BST and a key. The task is to find the inorder successor and predecessor of the given key. In case, if either of… Read More »
Category Archives: Binary Search Tree
Find postorder traversal of BST from preorder traversal
Given an array representing preorder traversal of BST, print its postorder traversal. Examples: Input : 40 30 35 80 100 Output : 35 30 100… Read More »
Find the closest element in Binary Search Tree | Space Efficient Method
Given a binary search tree and a target node K. The task is to find the node with the minimum absolute difference with given target… Read More »
Smallest number in BST which is greater than or equal to N
Given a Binary Search Tree and a number N, the task is to find the smallest number in the binary search tree that is greater… Read More »
Sum of k largest elements in BST
Given a BST, the task is to find the sum of all elements greater than and equal to kth largest element. Examples: Input : K… Read More »
Convert BST to Max Heap
Given a Binary Search Tree which is also a Complete Binary Tree. The problem is to convert a given BST into a Special Max Heap… Read More »
Self-Balancing-Binary-Search-Trees (Comparisons)
Self-Balancing Binary Search Trees are height-balanced binary search trees that automatically keeps height as small as possible when insertion and deletion operations are performed on… Read More »
set vs unordered_set in C++ STL
Pre-requisite : set in C++, unordered_set in C++ Differences : | set | unordered_set ——————————————————— Ordering | increasing order | no ordering | (by default)… Read More »
Red Black Tree vs AVL Tree
In this post we will compare Red Black Tree and AVL Tree. Red Black Tree: Properties: Self-Balancing is provided by painting each node with one… Read More »
Print BST keys in given Range | O(1) Space
Given two values n1 and n2 (where n1 < n2) and a root pointer to a Binary Search Tree. Print all the keys of tree… Read More »
BST to a Tree with sum of all smaller keys
Given a Binary Search Tree(BST), convert it to a Binary Tree such that every key of the original BST is changed to key plus sum… Read More »
Reverse a path in BST using queue
Given a binary search tree and a key, your task to reverse path of the binary tree. Prerequisite : Reverse path of Binary tree Examples… Read More »
Euler Tour | Subtree Sum using Segment Tree
Euler tour tree (ETT) is a method for representing a rooted tree as a number sequence. When traversing the tree using Depth for search(DFS), insert… Read More »
K’th Largest element in BST using constant extra space
Given a binary search tree, task is to find Kth largest element in the binary search tree. Input : k = 3 Root of following… Read More »
Special two digit numbers in a Binary Search Tree
Given a Binary Search Trees, task is to count the number of nodes which are having special two digit numbers. Prerequisite : Special Two Digit… Read More »