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
Therefore, in our body we will just add one to answer, as shown here: for (cursor
= head; cursor != null; cursor = cursor. link) answer++; Let's examine the loop on
an example. Suppose that the linked list has three nodes containing the ...
Suppose cursor refers to some node; 2. Then cursor . l i nk refers to the next node
(if there is one), as shown here: The reference in the shaded box is cursor. link,
and it refers to the next node after cursor. cursor 3. To move cursor to the next ...
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
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown