A binary search tree keeps every key smaller than a node in its left subtree and every larger key in its right subtree. Finding a key is one walk down from the root: compare, go left or right, repeat. Inserting walks the same path and hangs the new key where the walk falls off.