(2,4) trees, red-black trees, insertion, deletion, rotations, comparison of dictionary implementations.
Be able to step through insertion and deletion procedures for red-black trees.
Conceptual overview of balanced tree operations
Screencast Suthers 14 min
Top-down 2-3-4 trees, red-black trees, other algorithms
Textbook 14 pages
Provide four implementations of the Dynamic Set ADT and compare their performance.
Programming