## Java Software Structures: Designing and Using Data StructuresThe second edition of |

### From inside the book

Results 1-3 of 3

Page 258

An ordered list is a convenient collec- help organize the tournament play. An

ordered list can be used to store teams ordered by number of wins. To form the

match-ups for

, ...

An ordered list is a convenient collec- help organize the tournament play. An

ordered list can be used to store teams ordered by number of wins. To form the

match-ups for

**tion**to use when creating a touma- trie first round of the tournament, ...

Page 290

A CALCULATOR Key Concept Postfix notation is used for computa

it eliminates any questions regarding precedence. A calculator is a simple utility

that is provided with most operating systems. A calculator provides a keypad of ...

A CALCULATOR Key Concept Postfix notation is used for computa

**tion**becauseit eliminates any questions regarding precedence. A calculator is a simple utility

that is provided with most operating systems. A calculator provides a keypad of ...

Page 313

It is similar to an infinite loop, except that the "loop" occurs in

infinite loop problem, a programmer must be careful to design algorithms so that

they avoid infinite recursion. Any recursive definition must have a base case that

...

It is similar to an infinite loop, except that the "loop" occurs in

**tion**itself. As in theinfinite loop problem, a programmer must be careful to design algorithms so that

they avoid infinite recursion. Any recursive definition must have a base case that

...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Software Development | 2 |

ObjectOriented Design | 30 |

Collections | 83 |

Copyright | |

17 other sections not shown

### Other editions - View all

Java Software Structures: Designing & Using Data Structures John Lewis,Joseph Chase No preview available - 2005 |

### Common terms and phrases

abstract add add add addElement ancestor tree array implementation ArrayList AVL tree B-tree binary search tree binary tree boolean button called Card Chapter complexity constructor contains count create data structure deckSet defined dequeue disks doubly linked list element stored empty enqueue example expression tree Figure hash table hashing function heap ImageIcon insertion insertion sort integer interface isEmpty iterator Java Collections API jss2 Key Concept left child Lewis/Chase linear linked implementation linked list loop merge sort method 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 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 vertices waterfall model web crawler