文档介绍：Data Structures and Algorithms in Java
Michael T. Goodrich
Department puter Science University of California, Irvine
1
Roberto Tamassia
Department puter Science Brown University
0-471-73884-0
Fourth Edition
John Wiley & Sons, Inc.
ASSOCIATE PUBLISHER Dan Sayre
MARKETING DIRECTOR Frank Lyman
EDITORIAL ASSISTANT Bridget Morrisey
SENIOR PRODUCTION EDITOR Ken Santor
COVER DESIGNER Hope Miller
COVER PHOTO RESEARCHER Lisa Gee
COVER PHOTO Ralph A.
Clevenger/Corbis
This book was set in by the authors and printed and bound by . Donnelley
- Crawfordsville. The cover was printed by Phoenix Color, Inc.
Front Matter
To Karen, Paul, Anna, and Jack
-Michael T. Goodrich
2
To Isabel
-Roberto Tamassia
Preface to the Fourth Edition
This fourth edition is designed to provide an introduction to data structures and
algorithms, including their design, analysis, and implementation. In terms of curricula
based on the IEEE/ACM puting Curriculum, this book is appropriate for
use in the courses CS102 (I/O/B versions), CS103 (I/O/B versions), CS111 (A
version), and CS112 (A/I/O/F/H versions). We discuss its use for such courses in
more detail later in this preface.
The major changes, with respect to the third edition, are the following:
• Added new chapter on arrays, linked lists, and recursion.
• Added new chapter on memory management.
• Full integration with Java .
• Better integration with the Java Collections Framework.
• Better coverage of iterators.
• Increased coverage of array lists, including the replacement of uses of the class
with .
• Update of all Java APIs to use generic types.
• Simplified list, binary tree, and priority queue ADTs.
• Further streamlining of mathematics to the seven most used functions.
• Expanded and revised exercises, bringing the total number of reinforcement