Abstract
We are all familiar with lists: in very generic terms, a list is an ordered collection of items, and in the context of programming languages, the items are simple or structured data types. Individual lists can contain items of mixed types, but in this chapter you will only see homogeneous lists, in which all items are values of a single data type.
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
Rights and permissions
Copyright information
© 2016 Giulio Zambon
About this chapter
Cite this chapter
Zambon, G. (2016). Lists, Stacks, and Queues. In: Practical C. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-1769-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4842-1769-6_4
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-1768-9
Online ISBN: 978-1-4842-1769-6
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books