Binary Search Trees
A Binary Search Tree is a data structure where each node has at most two children. The left child contains values less than the parent, and the right child contains values greater than the parent.
- Insertion: Add a new node by comparing values and traversing left or right.
- Search: Find a value by comparing and moving left or right at each node.
- Deletion: Remove a node and restructure the tree to maintain the BST property.
- Traversal: Visit nodes in order (in-order, pre-order, or post-order).
Visit the Wikipedia page on Binary Search Trees for more details.