P480: Enumeration of all binary trees with $n$ internal nodes

P480: Enumeration of all binary trees with $n$ internal nodes

Input:

An integer $n$.

Output:

All binary trees with $n$ internal nodes.

Complexity:

$O(1)$ time per solution on average.

Comment:

Reference:

[Pallo1986] (Bibtex)