Gray code generation of binary trees encoded in left-child sequences

DOI10.1016/J.TCS.2025.115366MaRDI QIDQ6969914zbMATH OpenFDO

Authors Sawaka Hori, Kenji Mikawa

Publication date 19 June 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115366

zbMATH Keywords

Gray codebinary treecombinatorial problemconstant-time generationleft-child sequence

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Algorithms on strings (68W32)

Cites work

• A loopless algorithm for generating multiple binary tree sequences simultaneously
• A numbering system for binary trees
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
• Enumerating, Ranking and Unranking Binary Trees
• Generating Binary Trees Lexicographically
• Generation of Binary Trees from Ballot Sequences
• Left distance binary tree representations
• Lexicographic generation of ordered trees
• Ranking and unranking permutations in linear time
• The On-Line Encyclopedia of Integer Sequences

This page was built for publication: Gray code generation of binary trees encoded in left-child sequences

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