Abstract
When dynamically linked structures contain only one access type per record, they must be linearly linked. With two or more access types per record, the links between records may logically form nonlinear structures. The next four chapters describe various tree structures, tree applications, graphs, directed graphs, and sets.
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
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Beidler, J. (1997). Trees. In: Data Structures and Algorithms. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1854-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1854-8_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7312-7
Online ISBN: 978-1-4612-1854-8
eBook Packages: Springer Book Archive