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 76
clause indicates that the loop continues as long as index is still a location in the
used part of the array (i.e., i ndex < manyItems) and we have not yet found the
target (i.e., target != data[index]). Each time through the loop, the third clause ...
Searching for an Element in a B-Tree The set class has a method, contains, that
determines whether an element called target appears in the set. Searching for an
element in a B-tree follows the same idea as searching a binary search tree, ...
In this case, we did not find the target in the root, but the target still might appear
in subset [i]. We will make a recursive call: answer = subset [i ] .looseRemove(
target) ; The local variable answer is a boolean variable to keep track of whether
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown