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 15
... we would create various implementations, such as an emptyTreeNode, an
innerTreeNode, and a leaf TreeNode, that would distinguish the various
possibilities. The removeLeft Subtree Method To remove the left subtree of a
binary tree, we ...
IMPLEMENTING BINARY SEARCH TREES: AVL TREES Key Concept The
height of the right subtree minus the height of the left subtree is called Key
Concept There are only two ways that a tree, or any subtree of a tree, can
A 2-node contains one element and, like a binary search tree, the left subtree
contains elements that are less than that element and the right subtree contains
elements that are greater than or equal to that element. However, unlike a binary
What people are saying - Write a review
17 other sections not shown