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 84
D> add() addAll() removeRandom() remove() union() contains() equals!) isEmpty
() size() iterator() toString FIGURE 4.1 1 UML description of the LinkedSet<T>
class Analysis of remove The remove operation for the linked implementation ...
The remove operation consists of making sure that the list is not empty, finding
the element to be removed, and then handling one of four cases: the element to
be removed is the only element in the list, the element to be removed is the first ...
Deleting from a Chained Implementation If we have chosen to implement our
hash table using a chained implementation and an array with an overflow area,
then removing an element falls into one of five cases: Case 1 The element we are
What people are saying - Write a review
17 other sections not shown