LEXICOGRAPHIC GENERATION OF ROOTED TREES AND TREES

<正> In [1] an ordered tree is represented by a sequence of non-negative integers, and an algorithm is given to generate lexicographically all ordered trees with n vertices Now on the basis of [1] we define the representative sequences of rooted trees and trees, respectively. Then algorithms are given, respectively, to generate lexicographically all rooted trees and trees with n vertices.