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 35
All of these steps are O(l) except for the search for the target element, which is O(
n). As with any simple linear search, the best case is that the target element is the
first element of the list, the worst case is that the target element is the last ...
This puts the definition of equality under the control of the class being stored in
the tree. The find method throws an exception if the target element is not found.
Many methods associated with trees may be written either recursively or
This method also throws a ClassCastException if the element given is not
Comparable. This method makes use of ... of the element in the tree. The remove-
Element method is then called again as long as the tree contains the target
What people are saying - Write a review
17 other sections not shown