Abstract
A stack is an abstract data structure. Specifically, a stack is a list of elements in which you can insert the elements and also delete the elements from it. This list is open at one end and closed at the other end. The operations of insertion and deletion can be done only from the open end.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Shirish Chavan
About this chapter
Cite this chapter
Chavan, S. (2017). Stacks and Queues. In: C Recipes. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-2967-5_8
Download citation
DOI: https://doi.org/10.1007/978-1-4842-2967-5_8
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-2966-8
Online ISBN: 978-1-4842-2967-5
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books