Advertisement

Stacks

  • John Beidler
Part of the Undergraduate Texts in Computer Science book series (UTCS)

Abstract

This and the following two chapters describe three importantlogically linear structures: stacks, queues, and lists. Each structure islinearin that a linear ordering is maintained among objects within the structure. The linear relationship islogicalin that, unlike arrays, no assumption may be made regarding any relationship between the linear ordering of the objects and their actual locations in memory. These structures are distinguished from each other by the restrictions on the ways objects are accessed with respect to each structure.

Keywords

Dynamic Representation Access Type Package Body Array Location Private Declaration 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • John Beidler
    • 1
  1. 1.Department of Computing SciencesUniversity of ScrantonScrantonUSA

Personalised recommendations