Abstract
We present in this chapter an algorithm for drawing a random binary tree of a given height. This is a classical recursive algorithm such as those presented in the previous chapter. But, this time, we study how the complexity of such algorithms can be decreased by using numbers with low accuracy. We show that the same methods can be used to decrease the complexity of the generation of an arborescence.
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
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Alonso, L., Schott, R. (1995). Generation of Trees with a Given Height and Some Tricks about Complexity. In: Random Generation of Trees. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6353-9_9
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6353-9_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5150-2
Online ISBN: 978-1-4757-6353-9
eBook Packages: Springer Book Archive