# Binary Search Trees (BST)

Binary Search Trees are a fundamental data structure used to maintain a sorted dataset for quick lookup, addition, and deletion.

- The left subtree of a node contains only nodes with keys lesser than the node’s key.
- The right subtree of a node contains only nodes with keys greater than the node’s key.
- There are no duplicate nodes.
- Each subtree must also be a binary search tree.

### Efficiency

Operations such as search, insertion, and deletion take O(log n) time on average.

### Flexibility

BSTs can adapt to the dynamic dataset efficiently, maintaining order without requiring large-scale reorganization.

## Example of a Binary Search Tree

## Learn More

For more detailed information on Binary Search Trees, visit Wikipedia's Binary Search Tree Article.