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 18
16.2 2-3 TREES 498 Inserting Elements into a 2-3 Tree 499 Removing Elements
from a 2-3 Tree 501 16.3 2-4 TREES 505 16.4 B-TREES 506 16.5 MOTIVATION
FOR B-TREES 507 B* -trees 507 B+-trees 508 Analysis of B-trees 508 16.6 ...
search a single path from the root to a leaf in the tree and, at worst, the length of
that path would be log2n. Analysis of B-trees is similar. At worst, searching a B-
tree, we will have to search a single path from the root to a leaf and, at worst, that
If the propagation effect of a 2-3 tree insertion causes the root to split, the tree
increases in height. > A 2-4 tree expands on the concept a 2-3 tree to include the
use of 4-nodes. > A B-tree extends the concept of 2-3 and 2-4 trees so that nodes
What people are saying - Write a review
17 other sections not shown