本书是国外数据结构与算法分析方面的标准教材，使用最卓越的Java编程语言作为实现工具讨论了数据结构 (组织大量数据的方法) 和算法分析 (对算法运行时间的估计)。
　　随着计算机速度的不断增加和功能的日益强大，人们对有效编程和算法分析的要求也在增长。本书把算法分析与最有效率的Java程序的开发有机地结合起来，深入分析每种算法，内容全面、缜密严格，并细致讲解精心构造程序的方法。

第2版的特色如下：
● 全面阐述新的Java 5.0编程语言和Java Collections库。
● 改进内部设计，用图和实例阐述算法的实施步骤。
● 第3章对表、栈和队列的讨论进行了全面修订。
● 用一章专门讨论摊还分析和一些高级数据结构的实现。
● 每章末尾的大量练习按照难易程度编排，以增强对关键概念的理解。

无

Mark Allen Weiss：Mark Allen Weiss: 佛罗里达国际大学计算机学院教授，普林斯顿大学计算机科学博士。著名的计算机教育专家，著有Data Structures and Algorithm Analysis以及《Data Structures and Problem Solving: Using Java》、《Data Structures and Problem Solving: Using C++》等多本教材。目前是AP(Advanced Placement)考试计算机学科委员会的主席。

Chapter 1 Introduction
1.1 What’s the Book About
1.2 Mathematics Review
1.3 A Brief Introduction to Recursion
1.4 Implementing Generic Components Pre Java 5
1.5 Implementing Generic Components Using Java 5 Generics
1.6 Function Objects

Chapter 2 Algorithm Analysis
2.1 Mathematical Background
2.2 Model
2.3 What to Analyze
2.4 Running Time Calculations

Chapter 3 Lists, Stacks, and Queues
3.1 Abstract Data Types (ADTs)
3.2 The List ADT
3.3 Lists in the Java Collections API
3.4 Implementation of ArrayList
3.5 Implementation of LinkedList
3.6 The Stack ADT
3.7 The Queue ADT

Chapter 4 Trees
4.1 Preliminaries
4.2 Binary Trees
4.3 The Search Tree ADT–Binary Search Trees
4.4 AVL Trees
4.5 Splay Trees
4.6 Tree Traversals (Revisited)
4.7 B-Trees
4.8 Sets and Maps in the Standard Library
4.9 Summary

Chapter 5 Hashing
5.1 General Idea
5.2 Hash Function
5.3 Separate Chaining
5.4 Hash Tables Without Linked Lists
5.5 Rehashing
5.6 Hash Tables in the Standard Library
5.7 Extendible Hashing

Chapter 6 Priority Queues (Heaps)
6.1 Model
6.2 Simple Implementations
6.3 Binary Heap
6.4 Applications of Priority Queues
6.5 d-Heaps
6.6 Leftist Heaps
6.7 Skew Heaps
6.8 Binomial Queues
6.9 Priority Queues in the Standard Library

Chapter 7 Sorting
7.1 Preliminaries
7.2 Insertion Sort
7.3 A Lower Bound for Simple Sorting Algorithms
7.4 Shellsort
7.5 Heapsort
7.6 Mergesort
7.7 Quicksort
7.8 A General Lower Bound for Sorting
7.9 Bucket Sort
7.10 External Sorting

Chapter 8 The Disjoint Set Class
8.1 Equivalence Relations
8.2 The Dynamic Equivalence Problem
8.3 Basic Data Structure
8.4 Smart Union Algorithms
8.5 Path Compression
8.6 Worst Case for Union-by-Rank and Path Compression
8.7 An Application

Chapter 9 Graph Algorithms
9.1 Definitions
9.2 Topological Sort
9.3 Shortest-Path Algorithms
9.4 Network Flow Problems
9.5 Minimum Spanning Tree
9.6 Applications of Depth-First Search
9.7 Introduction to NP-Completeness

Chapter 10 Algorithm Design Techniques
10.1 Greedy Algorithms
10.2 Divide and Conquer
10.3 Dynamic Programming
10.4 Randomized Algorithms
10.5 Backtracking Algorithms

Chapter 11 Amortized Analysis
11.1 An Unrelated Puzzle
11.2 Binomial Queues
11.3 Skew Heaps
11.4 Fibonacci Heaps
11.5 Splay Trees

Chapter 12 Advanced Data Structures and Implementation
12.1 Top-Down Splay Trees
12.2 Red-Black Trees
12.3 Deterministic Skip Lists
12.4 AA-Trees
12.5 Treaps
12.6 k-d Trees
12.7 Pairing Heaps