Abstract
Binary search trees were introduced in Chapter 6. This chapter looks into variations of binary search trees. One possible set of specifications for a binary search tree appears in Listing 7.1. These specifications totally encapsulate the tree; no Tree_Type is made available. The package is instantiated with the client’s Object_Type and a linear ordering function, “<”, for Object_Type.
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
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Beidler, J. (1997). Tree Applications. In: Data Structures and Algorithms. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1854-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1854-8_7
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