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 80
Page 123
... node at the front of a linked list Initially , current is set to point to the first node in the list . Then a loop is used to move the current reference along ... Nodes Key Concept Dealing with the first node in 4.2 MANAGING LINKED LISTS 123.
... node at the front of a linked list Initially , current is set to point to the first node in the list . Then a loop is used to move the current reference along ... Nodes Key Concept Dealing with the first node in 4.2 MANAGING LINKED LISTS 123.
Page 124
... node in a linked list often requires special handling . Any node in the list can be deleted . We must maintain the ... Nodes Dummy Nodes.
... node in a linked list often requires special handling . Any node in the list can be deleted . We must maintain the ... Nodes Dummy Nodes.
Page 370
... node containing B. Repeating that process , we traverse to the left child again , the node containing D. Since that node does not have any children , we then visit that node , yielding D. Returning to the previous node , we visit the ...
... node containing B. Repeating that process , we traverse to the left child again , the node containing D. Since that node does not have any children , we then visit that node , yielding D. Returning to the previous node , we visit the ...
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