P365: Enumeration of all ordered trees with $n$ internal vertices

P365: Enumeration of all ordered trees with $n$ internal vertices

Input:

An integer $n$.

Output:

All ordered trees with $n$ internal vertices.

Complexity:

Comment:

Reference:

[Er1985] (Bibtex)