Open Data Structures: An Introduction

About the Book

Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code.

Analyzed and implemented in Java, the 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 treaps, 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; and B-trees.

A modern treatment of an essential computer science topic, Open Data Structures is a measured balance between classical topics and state-of-the art structures that will serve the needs of all undergraduate students or self-directed learners.

Table of Contents

• Chapter 1. Introduction
• Chapter 2. Array-Based Lists
• Chapter 3. Linked Lists
• Chapter 4. Skiplists
• Chapter 5. Hash Tables
• Chapter 6. Binary Trees
• Chapter 7. Random Binary Search Trees
• Chapter 8. Scapegoat Trees
• Chapter 9. Red-Black Trees
• Chapter 10. Heaps
• Chapter 11. Sorting Algorithms
• Chapter 12. Graphs
• Chapter 13. Data Structures for Integers
• Chapter 14. External Memory Searching