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

### From inside the book

Results 1-3 of 33

Page 231

For the

returning the only element in the queue. If, after removing the front element, the

queue is now empty, the rear reference is set to null. Note that in this case, the

front will ...

For the

**dequeue**operation, we must consider the situation in which we arereturning the only element in the queue. If, after removing the front element, the

queue is now empty, the rear reference is set to null. Note that in this case, the

front will ...

Page 235

This method first checks to see if the queue has at least one element to

If not, it throws an EmptyCollectionException, consistent with how we've been

dealing with such situations. If there is at least one element, it is stored for return,

...

This method first checks to see if the queue has at least one element to

**dequeue**.If not, it throws an EmptyCollectionException, consistent with how we've been

dealing with such situations. If there is at least one element, it is stored for return,

...

Page 241

... there is not a substantial difference between the enqueue operations for the

three implementations, so let us move on to the

The

steps: ...

... there is not a substantial difference between the enqueue operations for the

three implementations, so let us move on to the

**dequeue**operation.**dequeue**The

**dequeue**operation for the linked implementation consists of the followingsteps: ...

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