The generation of binary trees as a numerical problem
From MaRDI portal
Publication:4302813
DOI10.1145/128749.128753zbMath0799.68049OpenAlexW2116320678MaRDI QIDQ4302813
Publication date: 21 August 1994
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/128749.128753
Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Data structures (68P05)
Related Items
Uniform generation of forests of restricted height ⋮ Generating binary trees in A-order from codewords defined on a four-letter alphabet ⋮ Clean Reversible Simulations of Ranking Binary Trees ⋮ Counting labels in binary trees ⋮ Generating random binary trees -- a survey