Read more about Open Data Structures: An Introduction

Open Data Structures: An Introduction

(3 reviews)

Pat Morin, Carleton University

Copyright Year: 2013

ISBN 13: 9781927356388

Publisher: Athabasca University Press

Language: English

Formats Available

Conditions of Use

Attribution-NonCommercial-NoDerivs Attribution-NonCommercial-NoDerivs


Learn more about reviews.

Reviewed by Joseph Jess, Faculty, Linn-Benton Community College on 1/14/20

The text covers all areas I would expect to see in an introduction to data structures (lists, trees, hash tables, graphs, supporting searching and sorting algorithms for relevant structures, and plenty of complexity analysis) with a variety of... read more

Reviewed by Breeann Flesch, Associate Professor of Computer Science, Western Oregon University on 2/25/19

This book covers all of the topics typical in an introductory data structures class (complexity, sorts, stacks, queues, binary search trees, heaps, hash tables, etc). read more

Reviewed by Andrew Black, Professor, Portland State University on 8/21/16

It does a very thorough job of describing data structures for stacks, queues, lists, sets, and “sortedSets” — the latter not exactly a standard mathematical structure, but quite a useful one for many algorithms. It also has chapters on Priority... read more

Table of Contents

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

Ancillary Material

  • Submit ancillary resource
  • 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.

    About the Contributors


    Pat Morin is Professor in the School of Computer Science at Carleton University as well as founder and managing editor of the open access Journal of Computational Geometry. He is the author of numerous conference papers and journal publications on the topics of computational geometry, algorithms, and data structures.

    Contribute to this Page

    Suggest an edit to this book record