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 71
We begin with stacks, which is a fairly intuitive collection, both conceptually and
from an implementation perspective. This chapter examines both array-based
and linked implementation approaches and then compares them. Chapter 7 ...
Programming Projects 6.1 Complete the implementation of the LinkedStack class
presented in this chapter. Specifically ... 6.6 The linked implementation in this
chapter uses a count variable to keep track of the number of elements in the stack
IMPLEMENTING HEAPS: WITH ARRAYS An array implementation of a heap may
provide a simpler alternative than our linked implementation. Many of the
intricacies of the linked implementation relate to the need to traverse up and
down the ...
What people are saying - Write a review
17 other sections not shown