Binary search trees, while incredibly powerful, are only one way of using a tree structure to better organize data. Instead of splitting our data sets based on less-than or greater-than comparisons, we can optimize how the tree splits the data for the specific search problem at hand. In this chapter, for example, we tackle the problem of storing and searching strings in trees. Extending the binary search tree’s general branching approach to capture additional structure within the data enables us to search efficiently for target strings in a set of strings.
We begin by discussing how binary search trees ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
