On the Generation of Binary Trees

Abstract

A binary tree may be uniquely represented by a code reflecting traversal of the corresponding extended binary tree m a given monotomc order A general algorithm for constructing codes of all binary trees with n vertices is presented Different orders of traversal yield different ordermgs of the generated trees The algorithm IS illustrated with an example of the sequence of binary trees obtained from ballot sequences. © 1980, ACM. All rights reserved.