Java Software Structures: Designing and Using Data StructuresJava Software Structures teaches CS2 students how to develop high quality software systems that will withstand the test of users and the test of time. The authors provide a consistent presentation of data structures, starting with a conceptual overview and moving through an explanation of each data structure's usefulness. Various approaches to implementing each data structure are also explored along with a list of the Pros and Cons for each implementation. Good software engineering practices are kept on the front lines of discussion when it comes to the more complicated data structures. The book is designed to be flexible, allowing professors to cover the collections and issues they want to stress. - Provides a consistent, easy-to-follow presentation of data structures. - Presents material in a flexible way, professors can choose what they want to stress. - Utilizes the graphical user interface in such a way that instructors who dont cover GUIs can skip over these examples easily. - Strong focus on software engineering concepts throughout the text. - Reviews key language concepts in an appendix. - Perfect follow-up to Lewis/Loftus, Java Software Solutions. - Complete supplements pa |
From inside the book
Results 1-3 of 67
Page 263
... root is the ultimate ancestor of all nodes in a tree . Nodes that can be reached by following a path from a ... root to the node . This path length is determined by counting the number of edges that must be fol- lowed to get from the ...
... root is the ultimate ancestor of all nodes in a tree . Nodes that can be reached by following a path from a ... root to the node . This path length is determined by counting the number of edges that must be fol- lowed to get from the ...
Page 301
... root and the left child of the root is not null , then we traverse to the left child of the root and compare again . If the new element is greater than or equal to the element stored at the root and the right child of the root is null ...
... root and the left child of the root is not null , then we traverse to the left child of the root and compare again . If the new element is greater than or equal to the element stored at the root and the right child of the root is null ...
Page 316
... root around the right child of the root , and then perform a left rotation of the resulting right child of the root around the root . Figure 10.12 illustrates this process . leftright rotation Similarly , if the imbalance is caused by a ...
... root around the right child of the root , and then perform a left rotation of the resulting right child of the root around the root . Figure 10.12 illustrates this process . leftright rotation Similarly , if the imbalance is caused by a ...
Other editions - View all
Java Software Structures: Designing and Using Data Structures John Lewis,Joseph Chase No preview available - 2004 |
Common terms and phrases
addElement array implementation AVL tree B-tree BigDecimal BigInteger binary search tree binary tree chapter color component concept key Constant values constructors public contains count Creates data structure default defined dequeue derived from Object disk doubly linked list empty enqueue Figure final static int hash table hashCode heap icon insertion integer interface isEmpty iterator java.awt java.lang javax.swing key concept layout manager left child linked implementation linked list node null number of elements Object arg operation parameter parent path position public abstract public boolean public class public final static public int public Object public static final public static void public String toString public void queue radix sort recursive remove result Returns a string Returns a true Returns or sets right child root Serializable sort algorithm stack static final int string representation StringBuffer traversal true value undirected graph values that represent variables and constructs vertex vertices