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 73
The following constructor is defined for the ArraySet<T> class to set up an initially
empty set. The value of count is set to zero and the array that will store the
elements of the set is instantiated. This constructor uses a default value for the
addToFront (tempToken); // if the token is a left parenthesis, push it on the stack
else if (tempToken. equals (" (") ) postStack. push (tempToken); // if the token is a
right parenthesis, empty the stack down // to the matching left parenthesis adding
We then use a private method heapify Remove to reorder the heap as necessary.
/ /========== // Removes the element with the lowest value in the heap and //
returns a reference to it. Throws an Empty Heap Exception if // the heap is empty.
What people are saying - Write a review
17 other sections not shown