# Binary Search Tree

A binary search tree is a specific type of binary tree that is either empty, or each node in the tree contains a key, and all keys in the left subtree are less (numerically or alphabetically) than the identifier in the root node; all keys in the right subtree are greater than the identifier in the root node and the left and right subtrees are also binary search trees.

## Top Problems related to Binary Search Tree

Binary Search

Square Root (Integral)

Fourth Largest Element in the Array

Search In Rotated Sorted Array

Occurrence of X in a Sorted Array

Remove Duplicates From String

Time To Burn Tree

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

Largest Common Ancestor

Partial BST

Convert Bst To The Greater Sum Tree

Kth Largest Element In A Stream

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