Generating Random Binary Trees - A Survey

This paper surveys algorithms for generating unbiased random binary trees. There exist several linear time algorithms. The best algorithms use only integers of size O(n) to generate binary trees on n nodes.

[1]  Erkki Mäkinen,et al.  Left distance binary tree representations , 1987, BIT.

[2]  Frank Ruskey,et al.  On Rotations and the Generation of Binary Trees , 1993, J. Algorithms.

[3]  René Schott,et al.  Uniform Generation of a Schröder Tree , 1997, Inf. Process. Lett..

[4]  Ivan Stojmenovic.  On random and adaptive parallel generation of combinatorial objects , 1992, Int. J. Comput. Math..

[5]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[6]  L. Alonso,et al.  Random Generation of Trees , 1995, Springer US.

[7]  René Schott,et al.  Random generation of trees - random generators in computer science , 1995 .

[8]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[9]  Neal L. Oden,et al.  An algorithm to equiprobably generate all directed trees withk labeled terminal nodes and unlabeled interior nodes , 1984 .

[10]  Albert Nijenhuis,et al.  Combinatorial Algorithms for Computers and Calculators , 1978 .

[11]  G. N. Raney.  Functional composition patterns and power series reversion , 1960 .

[12]  Erkki Mäkinen,et al.  A Survey on Binary Tree Codings , 1991, Comput. J..

[13]  Jörg-Rüdiger Sack,et al.  Generating Binary Trees at Random , 1992, Inf. Process. Lett..

[14]  Philippe Flajolet,et al.  A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[15]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[16]  Mike D. Atkinson.  Uniform Generation of Rooted Ordered Trees with Prescribed Degrees , 1993, Comput. J..

[17]  Harry G. Mairson.  Generating Words in a Context-Free Language Uniformly at Random , 1994, Inf. Process. Lett..

[18]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[19]  Renzo Sprugnoli,et al.  The Random Generation of Directed Animals , 1994, Theor. Comput. Sci..

[20]  H. W. Martin,et al.  A random binary tree generator , 1989, CSC '89.

[21]  Ben Johnsen.  Generating binary trees with uniform probability , 1991, BIT Comput. Sci. Sect..

[22]  G. Furnas.  The generation of random, binary unordered trees , 1984 .

[23]  John Bainbridge.  A Heuristic Method for Generating Large Random Expressions , 1992, Inf. Process. Lett..

[24]  Renzo Sprugnoli,et al.  The generation of binary trees as a numerical problem , 1992, JACM.

[25]  Luc Devroye,et al.  On the Generation of Random Binary Search Trees , 1995, SIAM J. Comput..

[26]  Jean Marcel Pallo.  On the listing and random generation of hybrid binary trees , 1994 .

[27]  David Zerling,et al.  Generating binary trees using rotations , 1985, JACM.

[28]  Herbert S. Wilf,et al.  Combinatorial Algorithms: An Update , 1987 .

[29]  M. Ronan Sleep,et al.  Uniform Random Generation of Balanced Parenthesis Strings , 1980, TOPL.

[30]  Jean Marcel Pallo,et al.  Enumerating, Ranking and Unranking Binary Trees , 1986, Comput. J..

[31]  James F. Korsh.  Counting and Randomly Generating Binary Trees , 1993, Inf. Process. Lett..

[32]  Adolfo J. Quiroz,et al.  Fast random generation of binary, t-ary and other types of trees , 1989 .

[33]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .

[34]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[35]  Shmuel Zaks,et al.  Lexicographic Generation of Ordered Trees , 1980, Theor. Comput. Sci..