Table of Contents for Kurt Mehlhorn's Data Structures and Algorithms, 
available at http://www.mpi-sb.mpg.de/~mehlhorn/DatAlgbooks.html

Chapter 3
Page	Section	Name

1	3	Sets
3	3.1	Tries
3	3.1.1	Tries
6	3.1.2	Static tries, compressing sparse tables
14	3.2	Hashing
14	3.2.1	Hashing with Chaining
19	3.2.2	Hashing with Open Addressing
21	3.2.3	Perfect Hashing
32	3.2.4	Universal Hashing
36	3.2.5	Extendible Hashing
40	3.3	Searching Ordered Sets
41	3.3.1	Binary Search and Search Trees
44	3.3.2	Interpolation Search [incl. Quadratic Binary Search]
46	3.4	Weighted Trees
47	3.4.1	Optimum Weighted Trees, Dynamic Programming and Pattern Matching
62	3.4.2	Nearly Optimal Binary Search Trees
71	3.5	Balanced Trees
72	3.5.1	Weight-Balanced Trees
82	3.5.2	Height-Balanced Trees [(a,b)-Trees, 88 Red-Black Trees]
94	3.5.3	Advanced Topics on (a,b)-Trees
94	3.5.3.1	Mergable Priority Queues
98	3.5.3.2	Amortized Rebalancing Cost and Sorting Presorted Files
107	3.5.3.3	Finger Trees
119	3.5.3.4	Fringe Analysis
125	3.8.2 ?	Maintaining Dynamic Partitions of Linear Lists