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 32
10.1 HEAPS The Heap Storage Rules A heap is a binary tree where the
elements can be compared with each other using total order semantics. As we've
seen before (Figure 9.10 on page 460), a total order semantics means that all the
If we are uncertain about the heap's maximum size, then the array can grow and
shrink as needed. In Self-Test Exercise 2 on page 490, you'll be asked to write
definitions that would support the array implementation of a heap. The rest of this
I Adding an Element to a Priority Queue Pseudocode for Adding an Element The
priority queue has been implemented as a heap. 1. Place the new element in the
heap in the first available location. This keeps the structure as a complete ...
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown