Abstract
We present a linear algorithm which generates randomly and with uniform probability many kinds of trees: binary trees, ternary trees, arbitrary trees, forests of p k-ary trees,.... The algorithm is based on the definition of a generic kind of tree which can be coded in the form of words. These words, in turn, can easily be generated.
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 Forests of Trees Split into Patterns. In: Random Generation of Trees. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6353-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6353-9_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5150-2
Online ISBN: 978-1-4757-6353-9
eBook Packages: Springer Book Archive