Binary trees are a powerful node-based data structure that provides order maintenance, while also offering fast search, insertion, and deletion. They’re more complex than their linked list cousins, but offer tremendous value.
It is worth mentioning that in addition to binary trees, there are many other types of tree-based data structures as well. Heaps, B-trees, red-black trees, and 2-3-4 trees, as well as many other trees each have their own use for specialized scenarios.
In the next chapter, we’ll encounter yet another node-based data structure that serves as the heart of complex applications such as social networks and mapping software. It’s powerful yet nimble, and it’s called a graph.