The authors completely integrate in this book, the power of Java to present data structures in the context of the Java Collections Framework, Incorporating the principles of object-oriented programming (OOP) throughout the text. Abstraction is presented through abstract data types (ADTs), Unified Modeling Language (UML) diagrams, and Java interfaces and abstract classes. Linked structures is introduced rather early in the book and progressively covered in depth. The book covers all the topics of the standard course on data structure, including the main data structures and algorithms recommended by the ACM. Students with a basic preparation in Java or C++ will appreciate the spiral approach used to develop an increasingly sophisticated understanding of abstract topics such as the analysis of algorithms. Other pedagogic features include: Extensive review questions, exercises, programming problems, and projects at the end of each chapter to reinforce learning A profusion of multicolored diagrams, tables, and other visual aids to illustrate concepts graphically Simple, clear source code listings, presented with the syntax coloring found in professional Integrated Development Environment (IDE) editors Table of Contents Preface 1. Object-Oriented Programming. 2. Abstract Data Types. 3. Arrays. 4. Linked Structures. 5. Stacks. 6. Queues. 7. Collections. 8. Lists. 9. Hash Tables. 10. Recursion. 11. Trees. 12. Binary Trees. 13. Search Trees. 14. Heaps and Priority Queues. 15. Sorting. 16. Graphs. Appendixes: A. Answers and Hints. B. Java Review. C. Essential Mathematics. D. The Java Collections Frameworks. E. References. Index.