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

### From inside the book

Results 1-3 of 87

Page 178

A

the last element in is the first element out. A

elements are added and removed from the same end. We say that a

A

**STACK**ADT Key Concept**Stack**elements are processed in a UFO manner—the last element in is the first element out. A

**stack**is a linear collection whoseelements are added and removed from the same end. We say that a

**stack**is ...Page 179

FIGURE 6.2 The operations on a

separation between the role of the

using the

FIGURE 6.2 The operations on a

**stack**In the design of the**stack**ADT, we see theseparation between the role of the

**stack**and the role of the application that isusing the

**stack**. Notice that any implementation of this**stack**ADT is expected to ...Page 202

This implementation keeps track of the top of the

the array implementation and thus does not require the additional overhead of

storing a next reference in each node. Further, like the linked implementation, the

...

This implementation keeps track of the top of the

**stack**using an index similar tothe array implementation and thus does not require the additional overhead of

storing a next reference in each node. Further, like the linked implementation, the

...

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