Generating binary trees of bounded height

DOI10.1007/BF00288468zbMath0575.68067OpenAlexW2003559674MaRDI QIDQ1064071

B. George

Publication date: 1986

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00288468

zbMATH Keywords

algorithmencoding scheme for binary treesinternal nodes

Mathematics Subject Classification ID

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

Related Items (6)

Uniform generation of forests of restricted height ⋮ On the generation of binary trees from (0–1) codes ⋮ Ranking and Unranking of Non-regular Trees ⋮ A loopless algorithm for generating binary tree sequences ⋮ Algorithms for media ⋮ On generating B-trees with constant average delay and in lexicographic order

Cites Work

• Lexicographic generation of ordered trees
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations
• Centers of 2–Trees
• Constant Time Generation of Rooted Trees
• Ranking and Unranking of 2-3 Trees
• A numbering system for binary trees
• Generating Binary Trees Lexicographically
• Generation of Binary Trees from Ballot Sequences
• Ranking and Listing Algorithms for k-Ary Trees
• Generating t-Ary Trees Lexicographically
• Generating Trees and Other Combinatorial Objects Lexicographically
• Ranking and unranking of B-trees

This page was built for publication: Generating binary trees of bounded height