Java Software Structures: Designing and Using Data Structures
Key Benefit: This book not only teaches how to program in Java, but also how to develop high-quality software systems that will withstand the test of users and the test of time. Good software engineering practices are kept on the front lines of discussion when it comes to the more complicated data structures. Key Topics: The book is broken down into three parts allowing maximum flexibilty: Foundations, Linear Collections, and Nonlinear Collections. Readers can pick the order they wish to learn the information and skip items they already know without losing momentum. Market: A perfect follow-up to Lewis and Loftus' Java Software Solutions, Java Software Structures is for programmers who want to continue learning how to build software using Java.
36 pages matching recursive in this book
Results 1-3 of 36
What people are saying - Write a review
We haven't found any reviews in the usual places.
30 other sections not shown
array implementation AVL tree B-tree BigDecimal BigInteger binary search tree binary tree color component Constant values constructors public contains count Creates data structure default defined dequeue derived from Object disk doubly linked list empty enqueue Figure final int VK_ final static int hash table hashCode heap icon insertion integer interface isEmpty iterator java.lang layout manager left child Lewis/Chase linked implementation linked list node null number of elements 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