Balanced search trees are among the most versatile and flexible data structures. They're used extensively in theory and in practice. What sorts of balanced trees exist? How would you design them? And what can you do with them?
Readings
- Rudolf Bayer and Edward McCreight. Organization and Maintenance of Large Ordered Indices
- Leo Guibas and Robert Sedgewick. A Dichromatic Framework for Balanced Trees
Links