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 74
We could have had a different underlying element type such as a bag of double
numbers or a bag of characters. In fact, in Chapter 5, we'll see how to construct a
collection that can simultaneously handle many different types of elements, ...
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 elements in the node. For example
Postcondition: The largest element in the set has been removed, and the // value
of this element is the return value. The entire B-tree is still valid, // EXCEPT that
the number of elements in the root of this // set might be one less than the allowed
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown