Chapter 10. Trees
So far in this book, we have covered some sequential data structures. The first non-sequential data structure we covered in this book was the Hash Table. In this chapter, you will learn about another non-sequential data structure called a tree, which is very useful for storing information that needs to be found easily.
In this chapter, we will cover:
- Tree terminology
- Creating a binary search tree
- Traversing a tree
- Adding and removing nodes
- The AVL tree