Generating binary trees with uniform probability

DOI10.1007/BF01952779zbMath0714.68056MaRDI QIDQ751300

Ben Johnsen

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

binary treeenumerationMarkov chainBernoulli polynomialsCatalan numbers

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorics in computer science (68R05) Enumeration in graph theory (05C30)

Related Items (3)

Generating random binary trees -- a survey ⋮ Random generation of trees and other combinatorial objects ⋮ Constructing a binary tree efficiently from its traversals

Cites Work

• Efficient algorithms for tree reconstruction
• A numbering system for binary trees

This page was built for publication: Generating binary trees with uniform probability