Height on OrderedTree
The height: the most edges on a path from the root.
Called as CombinatorialStat(x, "Height"). 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: DyckPath, BinaryTree.
FindStat St000166
The depth minus 1 of an ordered tree.
| Object | Value |
|---|---|
[[]] | 1 |
[[[]]] | 2 |
[[],[]] | 1 |
[[[[]]]] | 3 |
[[[],[]]] | 2 |
[[[]],[]] | 2 |
[[],[[]]] | 2 |
[[[[[]]]]] | 4 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000166 has the rest.