Chapter 6. Advanced Searching Methods
In Chapter 5, Seeing the Forest through the Tree, we introduced the tree data structure and some of its variants. After seeing the binary search trees, we made a quick overview of other types of advanced trees such as red-black and AVL trees. During this chapter, we are going to dive deeper and learn about trees that allow us to make advanced search methods.
The topics covered in this chapter are as follows:
- Red-black trees
- AVL trees
- Trie trees (Radix trees)
- A look at several substring search algorithms
