Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.

Data structures presented in the book include:

 1. Stacks
 2. Queues, deques, and lists implemented as arrays and linked-lists
 3. Space-efficient implementations of lists
 4. Skip lists
 5. Hash tables and hash codes
 6. Binary search trees including treaps, scapegoat trees, and red-black trees
 7. Integer searching structures including binary tries, x-fast tries, and y-fast tries
 8. Heaps, including implicit binary heaps and randomized meldable heaps
 9. Graphs, including adjacency matrix and ajacency list representations
 10. B-trees.

This work contains code and/or text from opendatastructures.org.