Ranking and unranking of non-regular trees with a prescribed branching sequence
Mathematical and Computer Modelling: An International Journal
Cool-lex order and k-ary Catalan structures
Journal of Discrete Algorithms
| Hi-index | 0.00 |
An ordered tree is called a non-regular tree with a prescribed branching sequence (or non-regular tree for short) if its internal nodes have a prespecified degree sequence in preorder list. We define a concise representation, called right distance sequences to describe such trees. A coding tree helps us to systematically investigate the structural representation of non-regular trees. Consequently, we present a loopless algorithm to generate Gray-codes of non-regular trees using right distance sequences.