Binary Search Tree (BST)

Overview

A Binary Search Tree (BST) is a data structure that organizes data hierarchically, allowing for searching, insertion, and deletion. Each node in a BST contains a value and up to two children. The left child has a smaller value, and the right child has a larger value.

Key Features

• Each node has at most two children.
• The left subtree contains smaller values than the root.
• The right subtree contains larger values than the root.

Diagram

Learn More

For more information about Binary Search Trees, visit GeeksForGeeks: Binary Search Tree .

Applications of Binary Search Trees

BSTs are used in searching algorithms, sorting techniques, and databases. They form the foundation for many advanced data structures such as AVL trees and Red-Black trees.