Generating random binary trees - A survey

Authors:
Erkki Mäkinen
Affiliations:
-
Venue:
Information Sciences: an International Journal
Year:
1999

Citing 19
Cited 2

Left distance binary tree representations

BIT
A random binary tree generator

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Generating binary trees with uniform probability

BIT
The generation of binary trees as a numerical problem

Journal of the ACM (JACM)
Generating binary trees at random

Information Processing Letters
A survey on binary tree codings

The Computer Journal - Special issue on data structures
A heuristic method for generating large random expressions

Information Processing Letters
Counting and randomly generating binary trees

Information Processing Letters
On rotations and the generation of binary trees

Journal of Algorithms
Generating words in a context-free language uniformly at random

Information Processing Letters
The random generation of directed animals

Theoretical Computer Science
A calculus for the random generation of labelled combinatorial structures

Theoretical Computer Science
Generating binary trees using rotations

Journal of the ACM (JACM)
On the Generation of Random Binary Search Trees

SIAM Journal on Computing
Uniform generation of a Schro¨der tree

Information Processing Letters
Uniform Random Generation of Balanced Parenthesis Strings

ACM Transactions on Programming Languages and Systems (TOPLAS)
Random Generation of Trees: Random Generators in Computer Science

Random Generation of Trees: Random Generators in Computer Science
Combinatorial Algorithms: For Computers and Hard Calculators

Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

Simulating Size-constrained Galton-Watson Trees

SIAM Journal on Computing
The number of DFAs for a given spanning tree

The Journal of Supercomputing

Quantified Score

Hi-index	0.07

Visualization

Abstract

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.