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 97
... 15.1 A HEAP 472 The addElement Operation 472 The removeMin Operation
475 The f indMin Operation 476 15.2 USING HEAPS: HEAP SORT 476 15.3
USING HEAPS: PRIORITY QUEUES 477 15.4 IMPLEMENTING HEAPS: WITH
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 ...
Key Concept Many common operations can be defined for all list types. The
differences between them stem from how elements are added. Keep in mind that
these are conceptual views of lists. As with any collection, they can be
What people are saying - Write a review
17 other sections not shown