Binary Search Tree

• A binary tree where each node has at most two children

• Left child is less than parent, right child is greater

• Allows for efficient searching, insertion, and deletion