November 2016
Intermediate to advanced
286 pages
6h 6m
English
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 are similar to binary search trees with a new parameter for every node, the color of that node.
The color of the node can be either red or black. So, the data structure needed for red-black ...
Read now
Unlock full access