Binary Search Trees
- Binary search trees allow for fast insertion and removal of elements
- They are specially designed for fast searching
- A binary tree consists of two nodes, each of which has two child nodes
- All nodes in a binary search tree fulfill the property that:
- Descendants to the left have smaller data values than the node data
value
- Descendants to the right have larger data values than the node data
value