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 30
14.1 ANCESTOR TREE Key Concept A theoretical ancestor tree is an excellent
example of a perfectly balanced, inverted, binary tree in that every person has
exactly two parents, each of whom has two parents, each of whom has two
□till IMPLEMENTING AN ANCESTOR TREE As we discussed in the previous
section, we will implement four major components: the driver, the interface, the
AncestorTree, and the Person class. In the process, we will create an
14.3 IMPLEMENTING AN ANCESTOR TREE 449 Listing 14.3 continued //
Throws a NoSuchElementException if the specified target // element is not found
in the tree. //===================== ----- ---- -- - public Object find (Person ...
What people are saying - Write a review
17 other sections not shown