Java Software Structures: Designing and Using Data Structures
The second edition of Java Software Structures embraces the enhancements of Java 5.0, where all structures and collections are based on generics. The framework of the text walks the reader through three main areas: conceptualization, explanation, and implementation, allowing for a consistent and coherent introduction to data structures. The addition of integrated case studies provides complete examples to aid readers starting with the problem statement, to design rationale, through full implementation. Readers will learn how to develop high-quality software systems using well-designed collections and algorithms.
8 pages matching minheap in this book
Results 1-3 of 8
What people are saying - Write a review
We haven't found any reviews in the usual places.
17 other sections not shown
abstract add add add addElement AncestorTree array implementation ArrayList AVL tree B-tree binary search tree binary tree boolean called Card Chapter complexity constructor contains count create data structure deckSet defined dequeue disks doubly linked list element stored empty enqueue example Figure hash table hashing function heap Imagelcon insertion insertion sort integer interface isEmpty iterator Java Collections API JPanel jss2 Key Concept left child level-order traversal Lewis/Chase linear linked implementation linked list loop merge sort method minheap node null number of elements operation ordered list parameter parent path position postfix expression problem provides public class public void queue radix sort rear recursive reference variable remove removeMin represent return result Returns true right child root Self-Review Questions set collection sort algorithm stack static String subtree System.out.println target element temp tion toString traversal UML description undirected graph unordered list vertex waterfall model web crawler