A Comparison of Random Binary Tree Generators

DOI10.1093/COMJNL/45.6.653MaRDI QIDQ4415916zbMATH OpenOpenAlexFDO

Authors Jarmo Siltaneva, Erkki Mäkinen

Publication date 7 August 2003

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/45.6.653

zbMATH Keywords

asymptotic performance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Generating random binary trees -- a survey
• On the Generation of Random Binary Search Trees
• The generation of binary trees as a numerical problem
• The generation of random, binary unordered trees
• A linear-time algorithm for the generation of trees

Cited in

(6)

• A note on Rémy's algorithm for generating random binary trees
• Generating random binary trees -- a survey
• scientific article; zbMATH DE number 617583 (Why is no real title available?)
• scientific article; zbMATH DE number 3994870 (Why is no real title available?)
• On the Generation of Random Binary Search Trees
• Binarization Trees and Random Number Generation

This page was built for publication: A Comparison of Random Binary Tree Generators

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