Abstract
Recursive trees and binary search trees can be considered as the result of a growth process and although they are of different structure (in particular, concerning their degree distribution) they have many properties in common.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag/Wien
About this chapter
Cite this chapter
(2009). Recursive Trees and Binary Search Trees. In: Random Trees. Springer, Vienna. https://doi.org/10.1007/978-3-211-75357-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-211-75357-6_6
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-75355-2
Online ISBN: 978-3-211-75357-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)