Prentice Hall, 2011. — 1008 p. — 3rd Edition. — ISBN: 0136100910.
На англ. языке.
Data Structures and Abstractions with Java, 3e, is ideal for one- or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems.This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters — each with pedagogical tools to help students master each concept.¿Using the latest features of Java, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
Java Classes
Creating Classes from Other Classes
Designing Classes
Lists
List Implementations That Use Arrays
List Implementations That Link Data
Iterators
Java's Iterator Interfaces
The Efficiency of Algorithms
Recursion
An Introduction to Sorting
Faster Sorting Methods
Sorted Lists
Inheritance and Lists
Mutable, Immutable, and Cloneable Objects
Searching
Dictionaries
Dictionary Implementations
Hashing as a Dictionary Implementation
Stacks
Stack Implementations
Queues, Deques, and Priority Queues
Queue, Deque, and Priority Queue Implementations
Trees
Tree Implementations
A Binary Search Tree Implementation
A Heap Implementation
Balanced Search Trees
Graphs
Graph Implementations
Java Essentials
Exception Handling
File Input and Output
Documentation and Programming Style
Answers to Self-Test Questions