Abstract
We have looked at Scheme’s most common data structure, the list. We have seen how ordered lists and hierarchies can be represented. The focus in this chapter is on using data structures like these and other more abstract data structures in programs.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Grillmeyer, O. (1998). Data Structures. In: Exploring Computer Science with Scheme. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2937-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2937-5_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2855-9
Online ISBN: 978-1-4757-2937-5
eBook Packages: Springer Book Archive