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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison- Wesley, Reading, MA 1983.
G. Booch, Software Components with Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.
D. Knuth, The Art of Computer Programming, Volume 1, Fundamental Algorithms, Addison-Wesley, Reading, MA 1973.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Lins, C. (1989). The Bounded Deque. In: The Modula-2 Software Component Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-6396-5_15
Download citation
DOI: https://doi.org/10.1007/978-1-4684-6396-5_15
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-6398-9
Online ISBN: 978-1-4684-6396-5
eBook Packages: Springer Book Archive