10. AVL and Red-Black Trees
In This Chapter
As you learned in Chapter 8, “Binary Trees,” ordinary binary search trees offer important advantages as data storage structures. They enable quick search for an item with a given key, and quick insertion or deletion of an item. Other data storage structures, such as arrays, sorted arrays, linked lists, and sorted linked lists, ...