Includes bibliographical references and index.

"Using Java 1.1, Professor Thomas A. Standish brings the fundamentals of data structures and algorithms to a new light. Standish believes that Java offers the opportunity to take a fresh look at the subject matter. New languages bring with them new challenges, which the author is prepared to meet. For example, although Java is a language without explicit pointers, this book offers pointer diagrams to help students visualize, reason about, and understand this major data structures topic. Standish's clear presentation helps readers tie in the many concepts of data structures with recurring themes. Central ideas - such as modularity, levels of abstraction, efficiency, and tradeoffs - serve as integrators in the book in order to merge the material conceptually and to reveal its underlying unity and interrelationships."--Jacket.