Java Software Structures: Designing and Using Data StructuresThe 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. |
From inside the book
Results 1-3 of 87
Page 62
... Key Concept The equals method of the object class is also useful . Its purpose is to deter- mine if two objects are equal . The definition of the equals method provided by the object class returns true if the two object references ...
... Key Concept The equals method of the object class is also useful . Its purpose is to deter- mine if two objects are equal . The definition of the equals method provided by the object class returns true if the two object references ...
Page 472
... Key Concept A heap is a complete binary tree in which each node is less than or equal to both of its children . This definition describes a minheap . A heap can also be a max- heap , in which the node is greater than or equal to its ...
... Key Concept A heap is a complete binary tree in which each node is less than or equal to both of its children . This definition describes a minheap . A heap can also be a max- heap , in which the node is greater than or equal to its ...
Page 516
... key component of the elements ) to be stored in the collection , as in the case of ordered lists and binary search trees . In this chapter we will explore the concept of hashing , which means that the order - and , more specifically ...
... key component of the elements ) to be stored in the collection , as in the case of ordered lists and binary search trees . In this chapter we will explore the concept of hashing , which means that the order - and , more specifically ...
Other editions - View all
Java Software Structures: Designing and Using Data Structures John Lewis,Joseph Chase No preview available - 2004 |
Common terms and phrases
abstract data type abstract methods addAll addElement ancestor tree array implementation ArraySet<T AVL tree B-tree binary search tree binary tree BlackJack boolean Card Chapter child class class hierarchy complexity constructor contains count create data structure deck declared defined dequeue disks doubly linked list element stored empty evaluation example exception Figure graph hash table heap ImageIcon inheritance insertion instantiated integer interface invoked isEmpty iterator Java Collections API Key Concept left child Lewis/Chase LIBRARIES linear linked implementation linked list loop ment node null number of elements operand operation parameter parent particular path player position postfix expression problem provides public class public void queue radix sort recursive remove removeRandom represent return result Returns true right child root SAN DIEGO Self-Review Questions set collection sort algorithm stack static String System.out.println throw tion toString traversal UML description undirected graph waterfall model web crawler