chapter 1 Analysis of Algorithms -- chapter 2 Basic Structures -- chapter 3 :Trees -- chapter 4 Graphs -- part Part II: Priority Queues -- chapter 5 Leftist Trees -- chapter 6 Skew Heaps -- chapter 7 Binomial, Fibonacci, and Pairing Heaps -- chapter 8 Double-Ended Priority Queues -- part Part III: Dictionary Structures -- chapter 9 Hash Tables -- chapter 10 Balanced Binary Search Trees -- chapter 11 Finger Search Trees -- chapter 12 Splay Trees -- chapter 13 Randomized Dictionary Structures -- chapter 14 Trees with Minimum Weighted Path Length -- chapter 15 B Trees -- part Part IV: Multidimensional and Spatial Structures -- chapter 16 Multidimensional Spatial Data Structures -- chapter 17 Planar Straight Line Graphs -- chapter 18 Interval, Segment, Range, and Priority Search Trees -- chapter 19 Quadtrees and Octrees -- chapter 20 Binary Space Partitioning Trees -- chapter 21 R-trees -- chapter 22 Managing Spatio-Temporal Data -- chapter 23 Kinetic Data Structures -- chapter 24 Online Dictionary Structures -- chapter 25 Cuttings -- chapter 26 Approximate Geometric Query Structures -- chapter 27 Geometric and Spatial Data Structures in External Memory -- part Part V: Miscellaneous Data Structures -- chapter 28 Tries -- chapter 29 Suffix Trees and Suffix Arrays -- chapter 30 String Searching -- chapter 31 Persistent Data Structures -- chapter 32 PQ Trees, PC Trees, and Planar Graphs -- chapter 33 Data Structures for Sets -- chapter 34 Cache-Oblivious Data Structures -- chapter 35 Dynamic Trees -- chapter 36 Dynamic Graphs -- chapter 37 Succinct Representation of Data Structures -- chapter 38 Randomized Graph Data-Structures for Approximate Shortest Paths -- chapter 39 Searching and Priority Queues in o(log n) Time -- part Part VI: Data Structures in Languages and Libraries -- chapter 40 Functional Data Structures -- chapter 41 LEDA, a Platform for Combinatorial and Geometric Computing -- chapter 42 Data Structures in C++ -- chapter 43 Data Structures in JDSL -- chapter 44 Data Structure Visualization -- chapter 45 Drawing Trees -- chapter 46 Drawing Graphs -- chapter 47 Concurrent Data Structures -- part Part VII: Applications -- chapter 48 IP Router Tables -- chapter 49 Multi-Dimensional Packet Classification -- chapter 50 Data Structures in Web Information Retrieval -- chapter 51 The Web as a Dynamic Graph -- chapter 52 Layout Data Structures -- chapter 53 Floorplan Representation in VLSI -- chapter 54 Computer Graphics -- chapter 55 Geographic Information Systems -- chapter 56 Collision Detection -- chapter 57 Image Data Structures -- chapter 58 Computational Biology -- chapter 59 Elimination Structures in Scientific Computing -- chapter 60 Data Structures for Databases -- chapter 61 Data Mining -- chapter 62 Computational Geometry: Fundamental Structures -- chapter 63 Computational Geometry: Proximity and Location -- chapter 64 Computational Geometry: Generalized Intersection Searching.