Abstract
Linked data structures are in many ways the opposite of the contiguous ones that we have explored to some extent in the previous chapter using the example of arrays. In terms of complexity, they fail where those ones shine (first of all, at random access), but prevail at scenarios when a repeated modification is necessary. In general, they are much more flexible and so allow the programmer to represent almost any kind of a data structure, although the ones that require such level of flexibility may not be too frequent. Usually, they are specialized trees or graphs.
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
Notes
- 1.
However, in the Lisp machines, cons cells even had special hardware support, and such change would have made it useless.
- 2.
Although, for structs, it is implementation-dependent if this will work. In all the current implementations, it will.
- 3.
To further learn about this topic, I would recommend reading the relevant chapters from the book Practical Common Lisp: Generic Functions and Classes.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2021 Vsevolod Domkin
About this chapter
Cite this chapter
Domkin, V. (2021). Linked Lists. In: Programming Algorithms in Lisp. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-6428-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-4842-6428-7_6
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-6427-0
Online ISBN: 978-1-4842-6428-7
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)