Binary Search Tree

What is a Binary Search Tree?

A Binary Search Tree (BST) is a data structure that stores data in sorted order. Each node has up to two children. Values smaller than a node go to the left, and values larger than a node go to the right.

Common Operations

• Insert a new value
• Search for a value
• Remove a value

Why it is useful

Binary Search Trees can make searching, inserting, and deleting data more efficient than checking every value one by one.

Learn more here: Binary Search Tree on Wikipedia