Binary Search Tree (BST)

I. Definition:

A Binary Search Tree (BST) is a data structure that keeps elements in a sorted order for efficient lookup, insertion, and deletion.

II. Properties:

• Each node has up to two children
• Left child contains values less than the parent
• Right child contains values greater than the parent

III. BST Insertion:

1. Start at the root node
2. Compare the value to be inserted with the current node
3. Go to:
   1. the left subtree if it is smaller
   2. the right subtree if it is larger
   3. create a new node with the value to be inserted if you encounter a null node

IV. Useful Resources:

Learn more about BSTs on Wikipedia, or explore how they work interactively using this BST visualizer by USFCA.