Java Data Structures

Author: Thomas A. Standish, translated by Liu Ying and others
Publisher:
Publish Date: 2005-04-01
Features: Thomas A. Standish introduces the fundamentals of data structures and algorithms from a fresh perspective. Standish believes that Java provides an opportunity to re-examine the content of the subject, as this new development language brings new challenges. For example, although the Java language does not have explicit pointers, this book still provides pointer algorithms, which help students visualize this primary data structure. Standish's clear explanations help readers connect various data structures. Core concepts such as modularity, levels of abstraction, efficiency, and trade-offs are integrated throughout the book, aiming to combine many substantial concepts and reveal their underlying unity and connections. Key Focuses of the Book:
● Chapters 2 and Appendix A introduce the basics of object-oriented programming, enabling students who have not previously studied Java to get started quickly;
● Recursion is introduced cautiously as early as Chapter 4, helping students master this challenging concept.
● Chapter 5 introduces the concepts of modularity and data abstraction, while Appendix C covers key software engineering concepts and techniques.
● Each chapter includes a section titled "Traps," which helps students identify and avoid potential pitfalls.