Binary Search Tree (BST)

Overview

The Binary Search Tree (BST) is a fundamental data structure that allows efficient searching, insertion, and deletion.

Key Operations

• Insert – Add a new node while maintaining sorted order
• Search – Find a specific key in O(log n) time (on average)
• Delete – Remove nodes while preserving structure

Learn more about BSTs on Wikipedia.