Abstract
Hierarchical structures and systems are ubiquitous in applications. File systems in computers and corporate administration systems are examples of hierarchical structures. With containment relationships, components of a hardware system can be represented with a hierarchy as well.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
D. E. Knuth. The Art of Computer Programming, Volume 1, Funadamental Algorithms. Addison-Wesley, Reading, Mass., 1968, 1973.
R. E. Tarjan. Data Structures and Network Algorithms, Regional Conference Series in Applied Mathematics, Volume 44. SIAM, 1983.
R. Bayer. Binary b-trees for virtual memory. Proceedings of ACM SIGFIDET Workshop, ACM, 1971, pp. 219–235.
R. Bayer. Symmetric binary b-trees: Data structure and maintenance algorithms. Acta Informatica 1(1972) pp. 290–306.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Li, L. (1998). Trees. In: Java: Data Structures and Programming. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95851-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-95851-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-95853-3
Online ISBN: 978-3-642-95851-9
eBook Packages: Springer Book Archive