Binary Search Tree (BST)

Overview

A Binary Search Tree (BST) is a data structure that stores elements hierarchically. Each node has at most two children: left and right. The left child contains smaller values, and the right child contains larger values than the parent node.

Important Features

• Efficient searching, insertion, and deletion.
• In-order traversal produces sorted output.
• Supports both recursive and iterative implementations.

BST Diagram

Learn More

For more details, visit this Wikipedia page.