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 22
FIGURE 12.7 A complete tree Inorder Traversal Given the tree shown in Figure
12.7, an inorder traversal would produce the sequence D, B, E, A, C. As defined
earlier, inorder traversal is accomplished by visiting the left child of the node, then
However, this time the larger path length is in the right subtree of the right child of
the root. To get this tree into balance, we need to > Make the right child element
of the root the new root element. > Make the former root element the left child ...
Leftright Rotation in an AVL Tree If the balance factor of a node is -2, this means
that the node's left subtree has a path that is too long. We then check the balance
factor of the left child of the original node. If the balance factor of the left child is ...
What people are saying - Write a review
17 other sections not shown