Open In App

Binary Search Tree

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Share
Report issue
Report

A Binary Search Tree is a data structure used in computer science for organizing and storing data in a sorted manner. Each node in a Binary Search Tree has at most two children, a left child and a right child, with the left child containing values less than the parent node and the right child containing values greater than the parent node. This hierarchical structure allows for efficient searching, insertion, and deletion operations on the data stored in the tree.

Binary Search Tree

Introduction to Binary Search:

Basic Operations on BST:

Easy Standard Problems on BST:

Medium Standard Problems on BST:

Hard Standard Problems on BST:

Some Quizzes:

Quick Links :

Recommended:



Last Updated : 22 Feb, 2024
Like Article
Save Article
Share your thoughts in the comments
Similar Reads