A loopless algorithm for generating binary tree sequences

DOI10.1016/0020-0190(91)90178-KzbMath0735.68017OpenAlexW2164877055MaRDI QIDQ1182098

Dominique Roelants van Baronaigien

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90178-k

zbMATH Keywords

loopless algorithmbinary trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data structures (68P05)

Related Items (18)

Enumeration of binary trees ⋮ Loopless generation of \(k\)-ary tree sequences ⋮ Shifts and loopless generation of \(k\)-ary trees ⋮ On the loopless generation of binary tree sequences ⋮ A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ Loop Free Generation ofK-Ary Trees ⋮ A shift Gray code for fixed-content Łukasiewicz words ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ Optimal binary search trees ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ A-order generation of k-ary trees with a 4k–4 letter alphabet ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously ⋮ On generating B-trees with constant average delay and in lexicographic order ⋮ Fast algorithms for genegrating integer partitions ⋮ On generating \(k\)-ary trees in computer representation ⋮ Efficient loopless generation of Gray codes for \(k\)-ary trees.

Cites Work

• Unnamed Item
• Unnamed Item
• Generating binary trees of bounded height
• Generating t-ary trees in A-order
• Lexicographic generation of ordered trees
• A method and two algorithms on the theory of partitions
• Generating binary trees by transpositions
• Enumerating, Ranking and Unranking Binary Trees
• Binary tree gray codes
• Generating binary trees using rotations
• The rotation graph of binary trees is Hamiltonian
• A binary tree representation and related algorithms for generating integer partitions
• Efficient generation of the binary reflected gray code and its applications
• Generating Binary Trees Lexicographically
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Left distance binary tree representations

This page was built for publication: A loopless algorithm for generating binary tree sequences