Open Data Structures cover 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:

• Stacks
• Queues, deques, and lists implemented as arrays and linked-lists
• Space-efficient implementations of lists
• Skip lists
• Hash tables and hash codes
• Binary search trees including traps, scapegoat trees, and red-black trees
• Integer searching structures including binary tries, x-fast tries, and y-fast tries
• Heaps, including implicit binary heaps and randomized meldable heaps
• Graphs, including adjacency matrix and adjacency list representations
• B-trees.

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