Data Structures & Other Objects Using Java
This book takes a gentle approach to the data structures course in Java. It offers an early, self-contained review of object-oriented programming and Java to give students a firm grasp of key concepts, and allows those experienced in other languages to adjust easily. The book also offers a flexibility which allows professors such options as emphasizing object-oriented programming, covering recursion and sorting early or accelerating the pace of the course. This title meets the needs of professors searching for a book to balance the introduction of object-oriented programming and data structures with Java.
Results 1-3 of 40
The subtrees below a B-tree node. The number of subtrees below a node
depends on how many elements are in the node. Here is the rule: B-tree Rule 4:
The number of subtrees below a nonleaf node is always one more than the
number of ...
Let's look at an example to illustrate the rule "Every child of the root node is also
the root of a smaller B-tree." For the example, consider the following B-tree (with
MINIMUM equal to 1): 2 and 4 The root of this B-tree has two children, and each ...
Adding an Element to a B-Tree The add method of the set class adds a new
element to the B-tree. ... a somewhat "loose addition" method to complete its work
with the possibility that there is one element too many in the root node of the B-
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown