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 31
In this case we want to remove the leftmost node from the left subtree. For
example, suppose that the root of this tree activates removeLeftmost: "
Submariner" "Spiderman" "Superman" "Hawkeye" "Storm" "Thing" "Wolverine"
We must remove ...
The cursor could be non-null and it does have a left child, so we can't simply
ignore the left subtree of the cursor (as we did in cases 2 and 3). We could check
whether there is a right child, and if not, we could have a plan that ignores the
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 ...
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown