ABSTRACT

Although traditional texts present isolated algorithms and data structures, they do not provide a unifying structure and offer little guidance on how to appropriately select among them. Furthermore, these texts furnish little, if any, source code and leave many of the more difficult aspects of the implementation as exercises. A fresh alternative to

chapter 1|2 pages

Part I. INTRODUCTION

chapter 1|12 pages

Design Principles

chapter 2|20 pages

Selecting an Abstract Data Type

chapter 3|8 pages

How to Use This Book

chapter 2|2 pages

COLLECTION DATA STRUCTURES AND ALGORITHMS

chapter 4|4 pages

Part II Organization

chapter 5|24 pages

Foundations

chapter 7|6 pages

Collection of Elements

chapter 8|12 pages

Abstract Collection

chapter 9|14 pages

Positional Collection ADT

chapter 10|4 pages

Abstract Positional Collection

chapter 11|46 pages

Array Data Structure

chapter 12|14 pages

Circular Array Data Structure

chapter 14|24 pages

Tracked Array Data Structure

chapter 15|40 pages

Singly Linked List Data Structure

chapter 16|8 pages

Doubly Linked List Data Structure

chapter 17|6 pages

Buffer ADT and Its Implementation

chapter 18|4 pages

Queue ADT and Implementation

chapter 19|4 pages

Stack ADT and Implementation

chapter 20|12 pages

Set ADT

chapter 21|14 pages

Direct Addressing Data Structure

chapter 22|16 pages

Open Addressing Data Structure

chapter 23|22 pages

Separate Chaining Data Structure

chapter 24|10 pages

Priority Queue ADT

chapter 25|20 pages

Binary Heap Data Structure

chapter 26|26 pages

Leftist Heap Data Structure

chapter 27|24 pages

Pairing Heap Data Structure

chapter 28|20 pages

Fibonacci Heap Data Structure

chapter 29|12 pages

Ordered Collection ADT

chapter 30|16 pages

Sorted Array Data Structure

chapter 31|10 pages

Abstract Search Tree Class

chapter 32|28 pages

Binary Search Tree Data Structure

chapter 33|4 pages

Balanced Binary Search Trees

chapter 34|18 pages

Red-Black Tree Data Structure

chapter 35|14 pages

Splay Tree Data Structure

chapter 36|30 pages

B-Tree Data Structure

chapter 37|18 pages

B+-Tree Data Structure

chapter 38|26 pages

Skip List Data Structure

chapter 39|16 pages

Digitized Ordered Collection ADT

chapter 40|4 pages

Trie Node Types

chapter 41|32 pages

Trie Data Structure

chapter 42|12 pages

Compact Trie Data Structure

chapter 43|14 pages

Compressed Trie Data Structure

chapter 44|22 pages

Patricia Trie Data Structure

chapter 45|10 pages

Ternary Search Trie Data Structure

chapter 46|6 pages

Spatial Collection ADT

chapter 47|22 pages

KD-Tree Data Structure

chapter 48|28 pages

Quad Tree Data Structure

chapter 49|40 pages

Tagged Collection ADTs

chapter 50|14 pages

Tagged Bucket Collection ADTs

chapter 51|2 pages

Part III Organization

chapter 52|14 pages

Graph ADT

chapter 53|26 pages

Abstract Graph and Graph Algorithms

chapter 54|18 pages

Adjacency Matrix Data Structure

chapter 55|16 pages

Adjacency List Data Structure

chapter 56|8 pages

Weighted Graph ADT

chapter |2 pages

Part IV. APPENDICES

chapter |20 pages

A Java Fundamentals

chapter |12 pages

B Complexity Analysis

chapter 100|14 pages

Design Patterns Illustrated in This Book