Ordered tree generation algorithms
Date
1986
Authors
Roelants van Baronaigien, Dominique
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Algorithms have been created for generating all binary trees with n nodes, all k-ary trees with n nodes all ordered trees with n nodes, and all ordered trees with a particular degree sequence A survey of these ordered tree generation algorithms is presented here.
Two natural orderings [25] are described for listing k-ary trees These orderings are called A-order and B-order Many algorithms already exist for generatmg k -ary trees m B-order, but no algorithm exists for generating k-ary trees in A-order.
This thesis provides an algorithm for generating k-ary trees in A-order. The algorithm is shown to be, on average, constant time per tree generated for k =2. The thesis also provides the ranking and unranking algorithms associated with A-order.