Wrapping Up

The binary search tree is a powerful node-based data structure that provides order maintenance, while also offering fast search, insertion, and deletion. It’s more complex than its linked list cousin, but it offers tremendous value.

However, the binary search tree is just one type of tree. Trees are of many different kinds, and each type brings unique advantages to specialized situations. In the next chapter, we’re going to discover another tree that will bring unique speed advantages to a specific, but common, scenario.