Wrapping Up

So far, we’ve seen how different types of trees can optimize different types of problems. Binary search trees kept search fast while minimizing the cost of insertions, and heaps were the perfect tool for building priority queues.

In the next chapter, we’ll explore another tree that’s used to power some of the most common text-based operations you use on a day-to-day basis.