Description

Open Data Structures is an open content textbook that provides comprehensive coverage of the implementation and analysis of data structures such as stacks, queues, deques, linked-lists, hash tables, binary search trees, heaps, graphs, and B-trees. The book includes space-efficient implementations of lists, skip lists, integer searching structures including binary trie, x-fast tries, and y-fast tries, and randomized meldable heaps. All data structures are rigorously analyzed, implemented in Java and C++, and have provably good running times. The book is released under a Creative Commons Attribution License, which allows users to copy, distribute, use, and adapt the text and source code, even commercially. The Java, C++, and Python sources, along with build scripts, are available on Github.