Operations on Binary Search Tree

We can mainly do three types of operations on Binary Search Trees. We can insert, delete and search for an element in the Binary Search Tree. The time complexity for all the operations(Insert, Delete, Search) is O(Log(N)) where N is the total number of Nodes in the Tree.

Deletion in Binary Search Tree

By Souhard Swami

● Published At Apr 2022

The blog deals with the Deletion in the Binary search Tree and determines the best method for the Deletion in the Binary Search Tree.
... Keep reading ..

Binary Search Tree | Iterative Delete

By Apoorv

● Published At Feb 2022

In this article, we will discuss the solution to delete a node iteratively in the binary search tree along with its time complexity and space complexity ... Keep reading ..

Implementing Backward Iterator in BST

By Riya

● Published At Feb 2022

This article will discuss how to implement a backward iterator in BST, its C++ implementation, and its time and space complexity.... Keep reading ..

Implementing Forward Iterator in BST

By Apoorv

● Published At Feb 2022

This article will discuss the low-level design of BST iterator which has a lot of functions like returning the current pointer in BST, next pointer in BST, and isend() function, which tells if there is a node present at the right of the current node ... Keep reading ..

Insertion in Binary Search Tree

By Malay Gain

● Published At Nov 2021

One of the fundamental operations of the Binary Search Tree is to insert node binary search trees.... Keep reading ..

Insert a node in Binary Search Tree Iteratively

By Vaibhav Agarwal

● Published At Dec 2021

In this article, we will discuss the problem of inserting a node in the binary search tree iteratively.... Keep reading ..

Construct BST from the given pre-order traversal

By Gaurish Anand

● Published At Dec 2021

You are given a pre-order traversal of a BST. Construct the BST using this pre-order traversal array.... Keep reading ..

Construct a BST from given postorder traversal using Stack

By Aditya Narayan Joardar

● Published At Dec 2021

This article discusses how to construct a BST from given postorder traversal using Stack.... Keep reading ..

## Top Problems related to Operations on Binary Search Tree

Binary Search

Fourth Largest Element in the Array

Search In Rotated Sorted Array

Occurrence of X in a Sorted Array

Next Greater Element

Search In Infinite Sorted 0-1 Array

Position Of First One

Minimum Subarray With Required Sum

Nth Number

Longest Sub-string with at most K Distinct Characters

Longest Substring Without Repeating Characters

First and Last Position of an element in Sorted Array

Search In A Row Wise And Column Wise Sorted Matrix

Algorithm to find best insert position in sorted array

Climbing the leaderboard

Matrix Median

Kth Missing Element

Frequency In A Sorted Array

Square Root

Floor Value of X

Sort an array in wave form