Binary Search Tree (BST)

What is a BST?

A Binary Search Tree is a data structure where each node has at most two children, and values are organized so that left < root < right.

Key Features

• Fast search (O(log n) average)
• Maintains sorted order
• Supports insert and delete operations

Example Diagram

Learn more here: Binary Search Tree Wikipedia