A concise introduction to data structures using java / Mark J. Johnson, Central College, Pella, Iowa.

Incluye bibliografía (página 201-202).

Machine generated contents note: 1.A Brief Introduction to Java -- 1.1.Basics -- 1.2.Strings -- 1.3.Arrays -- 1.4.Using Objects -- 1.5.Writing Classes -- 2.Algorithm Analysis -- 2.1.Big-O Notation -- 2.2.Sorting: Insertion Sort -- 2.3.Searching: Binary Search -- 3.Integer Stacks -- 3.1.Stack Interface -- 3.2.Array Implementation -- 3.3.Linked Implementation -- 4.Generic Stacks -- 4.1.Generic Types -- 4.2.Generic Stack Implementations -- 4.3.Evaluating Expressions: Background -- 4.4.Evaluating Expressions: Implementations -- 5.Queues -- 5.1.Interface and Linked Implementation -- 5.2.Array Implementation -- 5.3.Inheritance: Fixed-Length Queues -- Project: Fixed-Length Queue Simulation -- 6.Lists -- 6.1.Interface -- 6.2.Array Implementation -- 6.3.Linked Implementation -- 6.4.Iterators -- 7.Recursion -- 7.1.Mathematical Functions -- 7.2.Visualizing Recursion -- 7.3.Recursive and Generalized Searches -- 7.4.Applications -- 8.Trees -- 8.1.Definitions and Examples -- 8.2.Traversals -- 8.3.Binary Tree Abstract Class -- Project: A Collection Hierarchy -- 9.Binary Search Trees -- 9.1.Queries -- 9.2.Insertion -- 9.3.Deletion -- 9.4.Performance -- 10.Heaps -- 10.1.Priority Queue Interface and Array-Based Heaps -- 10.2.Insertion and Deletion -- 10.3.Buildheap and Heapsort -- Project: Event-Based Simulation -- 11.Hash Tables -- 11.1.Map Interface and Linked Implementation -- 11.2.Hash Tables -- 11.3.Chaining -- 11.4.Linear Probing.