Computes the set of equivalence classes of rooted trees (in the
sense that the leaves of a node are unordered)
with n = length ks leaves where the set of heights of
the leaves matches the given set of numbers.
The height is defined as the number of edges from the leaf to the root.
TODO: better name?
|Adds unique labels to a Tree.
|Adds unique labels to a Forest
|labelling by depth
|Attaches the depth to each node. The depth of the root is 0.
|labelling by number of children
|Attaches the number of children to each node.
|Produced by Haddock version 2.6.1|