DistinctSubtrees on BinaryTree
The number of different nonempty subtrees.
Called as CombinatorialStat(x, "DistinctSubtrees"). The head's page has its examples.
Live
Distribution
Over BinaryTrees at each size, tallied here in your browser; sizes past 6 are not offered.
Also on
The same name on other carriers, each its own implementation: OrderedTree.
FindStat St001554
The number of distinct nonempty subtrees of a binary tree.
| Object | Value |
|---|---|
[.,.] | 1 |
[.,[.,.]] | 2 |
[[.,.],.] | 2 |
[.,[.,[.,.]]] | 3 |
[.,[[.,.],.]] | 3 |
[[.,.],[.,.]] | 2 |
[[.,[.,.]],.] | 3 |
[[[.,.],.],.] | 3 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001554 has the rest.