Coding Binary Trees by Words over an Alphabet with Four Letters

DOI10.1080/02522667.1992.10699110zbMath0761.68035OpenAlexW1970671297MaRDI QIDQ4024145

No author found.

Publication date: 25 February 1993

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

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

zbMATH Keywords

binary treesencoding scheme

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Data structures (68P05)

Related Items (2)

Generating binary trees in A-order from codewords defined on a four-letter alphabet ⋮ Ranking and unrankingk-ary trees with a 4k –4 letter alphabet

Cites Work

• Unnamed Item
• Permutation representation of k-ary trees
• Lexicographic generation of ordered trees
• Stack sortable permutations
• On a correspondence between binary trees and a certain type of permutation
• A Survey on Binary Tree Codings
• Enumerating, Ranking and Unranking Binary Trees
• Ranking and Unranking of Non-regular Trees
• A note on generating binary trees inA-order andB-order
• 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

This page was built for publication: Coding Binary Trees by Words over an Alphabet with Four Letters