Binary Search Tree

What is a BST?

A Binary Search Tree (BST) is a data structure where each node has at most two children. Values smaller than the node go left, and values larger go right.

Key Features

• Fast searching (O(log n))
• Efficient insertion
• Maintains sorted order

Example Diagram

Learn More