Loading...
Please wait, while we are loading the content...
Similar Documents
Stack ADT and Implementation
| Content Provider | Scilit |
|---|---|
| Author | Goldman, Sally. A. Goldman, Kenneth. J. |
| Copyright Year | 2007 |
| Description | Strengths: More specialized than a buffer, a stack is natural for applications that insert and remove elements only at one end of the buffer. That is, a stack implements a last-in-first-out (LIFO) line. By providing restricted access, it helps prevent accidental misuse of the data structure. Also, since all updates to the stack are made at one end, an efficient array-based implementation can be achieved with a non-circular array, and an efficient list-based implementation can be achieved with a singly linked list. Book Name: A Practical Guide to Data Structures and Algorithms using Java |
| Related Links | https://content.taylorfrancis.com/books/download?dac=C2009-0-19205-6&isbn=9780429147104&doi=10.1201/9781420010336-25&format=pdf |
| Ending Page | 307 |
| Page Count | 4 |
| Starting Page | 304 |
| DOI | 10.1201/9781420010336-25 |
| Language | English |
| Publisher | Informa UK Limited |
| Publisher Date | 2007-08-23 |
| Access Restriction | Open |
| Subject Keyword | Book Name: A Practical Guide To Data Structures and Algorithms Using Java Statistics and Probability Structure Misuse Implementation Buffer Efficient Circular |
| Content Type | Text |
| Resource Type | Chapter |