Abstract
This chapter revisits stack and queues. Instead of using arrays as done in Chaps. 2 and 3, it uses references to implement the structures which illustrates the ideas of data and procedural abstraction. The chapter also reinforces the ideas presented in Chaps. 5 and 6. The complete program uses a graphical user interface to implement an undo button using a stack.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Streib, J.T., Soma, T. (2017). Stacks and Queues Using References. In: Guide to Data Structures. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-70085-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-70085-4_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70083-0
Online ISBN: 978-3-319-70085-4
eBook Packages: Computer ScienceComputer Science (R0)