Leaves on OrderedTree
The number of vertices with no children.
Called as CombinatorialStat(x, "Leaves"). The head's page has its examples.
Live
Distribution
Over OrderedTrees 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: BinaryTree.
FindStat St000167
The number of leaves of an ordered tree.
| Object | Value |
|---|---|
[[]] | 1 |
[[[]]] | 1 |
[[],[]] | 2 |
[[[[]]]] | 1 |
[[[],[]]] | 2 |
[[[]],[]] | 2 |
[[],[[]]] | 2 |
[[[[[]]]]] | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000167 has the rest.