Abstract
We saw earlier how we can represent collections of elements such that we can efficiently iterate through them and efficiently merge two such collections. In this chapter, we turn “bags” into “sets” by considering data structures that allow us to efficiently insert, delete, and check for membership of elements.
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
© 2017 Thomas Mailund
About this chapter
Cite this chapter
Mailund, T. (2017). Sets and Search Trees. In: Functional Data Structures in R. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3144-9_6
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3144-9_6
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3143-2
Online ISBN: 978-1-4842-3144-9
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)