Toward an enumeration of unlabeled trees

We present an algorithm that, on input $n$, lists every unlabeled tree of order $n$.