Sur la génération des arbres binaires par les B-suites (Q798328)

Given an ordered tree T, one calls a sequence \(\{b_ i\}\), \(i=1,...,| T|\), a B-sequence if \(b_ i\) is the number of the first leaf in the largest subtree with leaf i as the last leaf. This paper uses B-sequences to characterize binary trees in order to generate a lexicographic list of all binary trees. The authors give a formula for the rank in this list of a given binary tree and conversely the B- sequence with a tree of given rank.