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 33
For the dequeue operation, we must consider the situation in which we are
returning the only element in the queue. If, after removing the front element, the
queue is now empty, the rear reference is set to null. Note that in this case, the
front will ...
This method first checks to see if the queue has at least one element to dequeue.
If not, it throws an EmptyCollectionException, consistent with how we've been
dealing with such situations. If there is at least one element, it is stored for return,
... there is not a substantial difference between the enqueue operations for the
three implementations, so let us move on to the dequeue operation. dequeue
The dequeue operation for the linked implementation consists of the following
What people are saying - Write a review
17 other sections not shown