Counting and randomly generating binary trees

DOI10.1016/0020-0190(93)90039-CMaRDI QIDQ2365815zbMATH OpenFDO

Authors James F. Korsh

Publication date 29 June 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90039-C

zbMATH Keywords

countinggenerating binary trees

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Review text

The title explains the paper.

Cites work

• A numbering system for binary trees
• Generating binary trees at random
• Generation of Binary Trees from Ballot Sequences
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)

Cited in

(8)

• Enumerating k-way trees
• Uniform generation of forests of restricted height
• Enumeration of binary trees
• Generating random binary trees -- a survey
• A Tree for Generating Bernoulli Numbers
• scientific article; zbMATH DE number 1788109 (Why is no real title available?)
• Binarization Trees and Random Number Generation
• Stochastic enumeration method for counting trees

This page was built for publication: Counting and randomly generating binary trees

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