Generating binary trees at random

DOI10.1016/0020-0190(92)90075-7zbMath0742.68012OpenAlexW2004566793WikidataQ62037511 ScholiaQ62037511MaRDI QIDQ1186567

Jörg-Rüdiger Sack, Michael D. Atkinson

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90075-7

zbMATH Keywords

binary treesbracket sequences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (10)

Uniform generation of forests of restricted height ⋮ Counting and randomly generating binary trees ⋮ An optimal algorithm for realizing a Delaunay triangulation ⋮ Generating binary trees in A-order from codewords defined on a four-letter alphabet ⋮ Sampling planar tanglegrams and pairs of disjoint triangulations ⋮ A heuristic method for generating large random expressions ⋮ Generating strictly binary trees at random based on convex polygon triangulations ⋮ Generating random binary trees -- a survey ⋮ Taylor expansions for Catalan and Motzkin numbers ⋮ A workbench for computational geometry

Cites Work

• A numbering system for binary trees
• On Fluctuations in Coin-Tossing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating binary trees at random