This document discusses binary search trees, including:
- Binary search trees allow for fast addition and removal of data by organizing nodes in a way that satisfies ordering properties.
- New nodes are inserted by recursively searching the tree and placing the node in the proper position to maintain ordering - left subtrees must be less than the root and right subtrees greater than or equal.
- The insert function recursively moves down the tree until an unused leaf node is found in the correct position based on comparing its data to the data being inserted.