As the name suggests, search trees are trees that are designed to help you search for elements. Update on search. I'm still thinking about the final assignment. No class Friday. Another strategy for building dictionaries is to use search trees .
Search trees use the basic idea of binary search, but encapsulate it in a particular way.
For example, we might build the following structure for the first seven letters of the alphabet. They look somewhat like upside-down trees . The same way we use binary search. To find an element in a search tree, you compare the object you're looking for to the current node. If the object you're looking for is smaller, you follow the left branch.