Text

Open Data Structures An Introduction

---

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.

---

Availability

No copy data

Detail Information

Series Title

-

Call Number

336 pages

Publisher

Canada : AU Press., 2013

Collation

-

Language

English

ISBN/ISSN

9781927356388.01

Classification

336 pages

Content Type

text

Media Type

computer

Carrier Type

online resource

Edition

-

Subject(s)

Computing

Specific Detail Info

-

Statement of Responsibility

Pat Morin

Other Information

Cataloger

Arin

Source

-

Validator

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment