Data Structures and Other Objects Using JavaThis 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. The new edition has been updated to cover Java 1.3 and includes new appendices with more reference material on such topics as Java collections. It also features increased coverage of object-oriented programming and inheritance. New exercises on radix sort and shell sort have also been added. |
From inside the book
Results 1-3 of 88
... remove a midlist node , we must set up a reference to the node that is just before the node we are removing . For example , to remove the 42 from the following list , we would need to set up selection as shown here : head selection 10 ...
... removed ) . Example : If n is a reference to a node in a tree and n has a right child , then we can remove the leftmost node of n's right subtree with this statement : n.setRight ( n.getRight ( ) . removeLeftmost ( ) ) ; Let's look at ...
... Removing an Element from a B - Tree The remove method of the set removes an element from the B - tree . Most of the removal work will be accomplished with a private method , looseRemove , which performs a loose removal that is analogous ...
Contents
CHAPTER | 2 |
LEARNING OBJECTIVES | 14 |
Java Classes and Information Hiding | 40 |
Copyright | |
44 other sections not shown