Generating binary trees of bounded height
Acta Informatica
A simple algorithm for generating non-regular trees in lexicographic order
The Computer Journal
Lexicographic listing and ranking of t-ary trees
The Computer Journal
Generating t-ary trees in A-order
Information Processing Letters
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Generating binary trees using rotations
Journal of the ACM (JACM)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Generation of Binary Trees from Ballot Sequences
Journal of the ACM (JACM)
On the Generation of Binary Trees
Journal of the ACM (JACM)
A Note on Enumerating Binary Trees
Journal of the ACM (JACM)
A numbering system for binary trees
Communications of the ACM
Generating random binary trees - A survey
Information Sciences: an International Journal
| Hi-index | 0.00 |
The problem of generating random, uniformly distributed, binarytrees is considered. A closed formula that counts the number of treeshaving a left subtee with k-1 nodes k=1,2,...,n is found. By inverting the formula, random trees withn nodes are generated according to the appropriateprobability distribution, determining the number of nodes in the leftand right subtrees that can be generated recursively. The procedure isshown to run in time On, occupying an extra space in the order ofOn.