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

### From inside the book

Results 1-3 of 39

Page 84

Collections can be separated into two broad categories:

the name implies, a

are organized in a straight line. A nonlinear collection is one in which the ...

Collections can be separated into two broad categories:

**linear**and nonlinear. Asthe name implies, a

**linear**collection is one in which the elements of the collectionare organized in a straight line. A nonlinear collection is one in which the ...

Page 336

This section examines two common approaches to searching: a

and a binary search. Later in this book other search techniques are presented

that use the characteristics of particular data structures to facilitate the search

process.

This section examines two common approaches to searching: a

**linear**searchand a binary search. Later in this book other search techniques are presented

that use the characteristics of particular data structures to facilitate the search

process.

Page 526

Thus we see that

the open addressing method is quadratic probing. Using quadratic probing,

instead of using a

...

Thus we see that

**linear**probing may not be the best approach. A second form ofthe open addressing method is quadratic probing. Using quadratic probing,

instead of using a

**linear**approach, once we have a collision, we follow a formula...

### 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