Although there are many advanced and specialized texts and handbooks on algorithms, until now there was no book that focused exclusively on the wide variety of data structures that have been reported in the literature. The Handbook of Data Structures and Applications responds to the needs of students, professionals, and researchers who need a mains

chapter 1|26 pages

Analysis of Algorithms

chapter 2|16 pages

Basic Structures

chapter 3|18 pages


chapter 4|26 pages


part |2 pages

Part II: Priority Queues

chapter 5|10 pages

Leftist Trees

chapter 6|10 pages

Skew Heaps

chapter 7|20 pages

Binomial, Fibonacci, and Pairing Heaps

chapter 8|24 pages

Double-Ended Priority Queues

part |2 pages

Part III: Dictionary Structures

chapter 9|20 pages

Hash Tables

chapter 10|28 pages

Balanced Binary Search Trees

chapter 11|12 pages

Finger Search Trees

chapter 12|24 pages

Splay Trees

chapter 13|22 pages

Randomized Dictionary Structures

chapter 14|24 pages

Trees with Minimum Weighted Path Length

chapter 15|22 pages

B Trees

part |2 pages

Part IV: Multidimensional and Spatial Structures

chapter 16|30 pages

Multidimensional Spatial Data Structures

chapter 17|18 pages

Planar Straight Line Graphs

chapter 19|26 pages

Quadtrees and Octrees

chapter 20|20 pages

Binary Space Partitioning Trees

chapter 21|24 pages


chapter 22|20 pages

Managing Spatio-Temporal Data

chapter 23|18 pages

Kinetic Data Structures

chapter 24|12 pages

Online Dictionary Structures

chapter 25|10 pages


chapter 26|18 pages

Approximate Geometric Query Structures

part |2 pages

Part V: Miscellaneous Data Structures

chapter 28|20 pages


chapter 29|22 pages

Suffix Trees and Suffix Arrays

chapter 30|24 pages

String Searching

chapter 31|26 pages

Persistent Data Structures

chapter 32|28 pages

PQ Trees, PC Trees, and Planar Graphs

chapter 33|22 pages

Data Structures for Sets

chapter 34|28 pages

Cache-Oblivious Data Structures

chapter 35|18 pages

Dynamic Trees

chapter 36|20 pages

Dynamic Graphs

chapter 37|22 pages

Succinct Representation of Data Structures

part |2 pages

Part VI: Data Structures in Languages and Libraries

chapter 40|18 pages

Functional Data Structures

chapter 42|18 pages

Data Structures in C++

chapter 43|22 pages

Data Structures in JDSL

chapter 44|14 pages

Data Structure Visualization

chapter 45|20 pages

Drawing Trees

chapter 46|22 pages

Drawing Graphs

chapter 47|30 pages

Concurrent Data Structures

part |2 pages

Part VII: Applications

chapter 48|24 pages

IP Router Tables

chapter 49|20 pages

Multi-Dimensional Packet Classification

chapter 51|16 pages

The Web as a Dynamic Graph

chapter 52|20 pages

Layout Data Structures

chapter 53|30 pages

Floorplan Representation in VLSI

chapter 54|18 pages

Computer Graphics

chapter 55|22 pages

Geographic Information Systems

chapter 56|20 pages

Collision Detection

chapter 57|18 pages

Image Data Structures

chapter 58|18 pages

Computational Biology

chapter 60|22 pages

Data Structures for Databases

chapter 61|22 pages

Data Mining