Advertisement

The Bounded Deque

  • Charles Lins
Part of the Springer Compass International book series (COMPASS)

Abstract

As the reader may remember from Chapter 9, a deque is a double-ended queue permitting insertion and removal of items at either the front or the back of the structure. Chapter 14 presents the bounded form of deque — a data structure having many similarities with the bounded queue discussed in Chapter 10.

Keywords

Bounded Form Loop Index Abstract Data Type Additional Constructor Additional Selector 
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.

References

  1. [1]
    A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison- Wesley, Reading, MA 1983.MATHGoogle Scholar
  2. [2]
    G. Booch, Software Components with Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.Google Scholar
  3. [3]
    D. Knuth, The Art of Computer Programming, Volume 1, Fundamental Algorithms, Addison-Wesley, Reading, MA 1973.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

  • Charles Lins
    • 1
  1. 1.Apple Computer, Inc.CupertinoUSA

Personalised recommendations