Abstract
A representation of binary rooted ordered trees is generalized to binary rooted unordered trees. This representation is used in order to generate lexicographically all the binary rooted unordered trees with n internal nodes as a list. We present computer procedures producing such a list.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have