A note on Rémy's algorithm for generating random binary trees

MaRDI QIDQ1407492zbMATH OpenFDO

Authors Jarmo Siltaneva, Erkki Mäkinen

Publication date 16 September 2003

Published in Missouri Journal of Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

unbiased random binary treesRémy's algorithm

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• On the Generation of Random Binary Search Trees
• Generating random binary trees -- a survey
• A note on the generation of binary trees
• A Comparison of Random Binary Tree Generators
• The generation of random, binary unordered trees
• Random binary trees. Algorithms, asymptotics and statistics
• On growing random binary trees
• Generating binary trees at random
• A note on the Horton-Strahler number for random binary search trees
• On the subtrees of random binary search trees

Cited in

(2)

• Generating random binary trees -- a survey
• scientific article; zbMATH DE number 3994870 (Why is no real title available?)

This page was built for publication: A note on Rémy's algorithm for generating random binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407492)