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 33
... heap - which one ? 77 69 3 91 46 77 52 11 69 3 11 46 77 91 69 3 11 46 The tree on the left is not a heap because it ... Heaps 503 The Priority Queue ADT with Heaps.
... heap . 1. Place the new element in the heap in the first available location . This keeps the structure as a complete binary tree , but it might no longer be a heap since the new element might ... Heaps 505 Removing an Element from a Heap.
... heap . This rearrangement is accomplished by using a private method with the following specification : private static void makeHeap ( int [ ] data , int n ) ; // Precondition : data is an array with at least n ... Heap 631 Making the Heap.
Contents
CHAPTER | 2 |
LEARNING OBJECTIVES | 14 |
Java Classes and Information Hiding | 40 |
Copyright | |
44 other sections not shown