Generating binary trees in A-order from codewords defined on a four-letter alphabet

DOI10.1080/02522667.1994.10699193zbMath1105.68356OpenAlexW2316419065MaRDI QIDQ4321109

No author found.

Publication date: 25 June 1996

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1994.10699193

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Ranking and unrankingk-ary trees with a 4k –4 letter alphabet ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order

Cites Work

• Generating t-ary trees in A-order
• Lexicographic generation of ordered trees
• Stack sortable permutations
• Grammatical codes of trees
• Generating binary trees at random
• Some more properties of Catalan numbers
• A Survey on Binary Tree Codings
• TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
• Enumerating, Ranking and Unranking Binary Trees
• Ranking and Unranking of Non-regular Trees
• A note on generating binary trees inA-order andB-order
• Efficient Generation of k-ary Trees in Natural Order
• Coding Binary Trees by Words over an Alphabet with Four Letters
• A numbering system for binary trees
• Generating Binary Trees Lexicographically
• The generation of binary trees as a numerical problem

This page was built for publication: Generating binary trees in A-order from codewords defined on a four-letter alphabet