when adding an entry to a binary search tree, the search ends at a leaf if the entry is not already in the tree.