Java Software Structures: Designing and Using Data Structures
The second edition of Java Software Structures embraces the enhancements of Java 5.0, where all structures and collections are based on generics. The framework of the text walks the reader through three main areas: conceptualization, explanation, and implementation, allowing for a consistent and coherent introduction to data structures. The addition of integrated case studies provides complete examples to aid readers starting with the problem statement, to design rationale, through full implementation. Readers will learn how to develop high-quality software systems using well-designed collections and algorithms.
Results 1-3 of 87
A STACK ADT Key Concept Stack elements are processed in a UFO manner—
the last element in is the first element out. A stack is a linear collection whose
elements are added and removed from the same end. We say that a stack is ...
FIGURE 6.2 The operations on a stack In the design of the stack ADT, we see the
separation between the role of the stack and the role of the application that is
using the stack. Notice that any implementation of this stack ADT is expected to ...
This implementation keeps track of the top of the stack using an index similar to
the array implementation and thus does not require the additional overhead of
storing a next reference in each node. Further, like the linked implementation, the
What people are saying - Write a review
17 other sections not shown