P3: Enumeration of all subtrees in an input tree

P3: Enumeration of all subtrees in an input tree

Input:

A tree $T=(V, E)$.

Output:

All subtrees included in $T$.

Complexity:

$O(|V|)$ delay and $O(|V|)$ space.

Comment:

Reference:

[Ruskey1981] (Bibtex)