This textbook teaches classical open data structures like stacks, queues, priority queues, dictionaries, ordered dictionaries and graphs using Java code examples. It provides rigorous yet accessible explanations of algorithmic concepts and data structure implementations to serve as a reusable textbook enabling independent study.
Detailed Overview
The content covers basic algorithm analysis and underlying theory of data structure efficiency. Individual chapters focus on specific data structure categories, exploring multiple implementation options in-depth through code walking through structure construction and common operations. Structures covered include arrays, linked lists, hash tables, binary search trees, treaps, scapegoat trees, red-black trees, priority queues like heaps and B-trees, tries, and graph representations. Released under an open license, readers require only basic programming knowledge to follow along or modify the provided Java code. Its thorough theoretical grounding and practical code also benefit computer scientists and programmers. The hands-on yet rigorous approach makes this an excellent resource for students and professionals to understand classical data structures, analyze algorithms, and implement optimized solutions in Java.
Citation and License
Morin, P. (2013). Open data Structures. https://opendatastructures.org/. AU Press. https://www.aupress.ca/books/120226-open-data-structures/. Open source under CC BY 2.5 CA DEED license. The license can be viewed here: https://creativecommons.org/licenses/by/2.5/ca/
Download
