The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich and Tomassia s approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures.
The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich and Tomassia s approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures. For each ADT presented in the text, the authors provide an associated Java interface. Concrete data structures realizing the ADTs are provided as Java classes implementing the interfaces. The Java code implementing fundamental data structures in this book is organized in a single Java package, net.datastructures. This package forms a coherent library of data structures and algorithms in Java specifically designed for educational purposes in a way that is complimentary with the Java Collections Framework.
1 Java Primer
2 Object-Oriented Design
3 Fundamental Data Structures
4 Algorithm Analysis
5 Recursion
6 Stacks, Queues, and Deques
7 List and Iterator ADTs
8 Trees
9 Priority Queues
10 Maps, Hash Tables, and Skip Lists
11 Search Trees
12 Text Processing
13 Sorting and Selection
14 Graph Algorithms
15 Memory Management and B-Trees