Binary Search Tree (BST)

A Binary Search Tree is a data structure that stores elements in a way that allows fast lookup, addition, and removal. Each node has up to two children, and for any given node, the left child’s value is smaller, and the right child’s value is larger.

Key Operations

• Insert a new value into the tree.
• Search for a value in the tree.
• Delete a value while maintaining the BST property.

Example Diagram

Learn more about BSTs on Wikipedia.