Abstract
A binary tree is characterized as a sequence of “graftings”. This sequence is used to construct a Markov chain useful for generating trees with uniform probability. A code for the Markov chain gives a characteristic binary string for the trees. The main result is the calculation of the transition probabilities of the Markov chain. Some applications are pointed out.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Graham, R. L., Knuth, D. E., Patashnik, O:Concrete Mathematics. Addison-Wesley 1989.
R. W. Hamming:Coding and Information Theory. Prentice-Hall 1980.
Gary D. Knott:A numbering system for binary trees. CACM, Vol 20, No. 2, 1977.
Andrzei Proskurowski:On the generation of binary trees. JACM, Vol. 27, No. 1, 1980.
Marvin Solomon and Raphael A. Finkel:A note on enumerating binary trees. JACM, Vol. 27, No. 1, 1980.
Slough, W. and Efe, K.:Efficient algorithms for tree reconstruction. BIT, Vol. 29, No. 2, 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Johnsen, B. Generating binary trees with uniform probability. BIT 31, 15–31 (1991). https://doi.org/10.1007/BF01952779
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01952779