CollessIndex on BinaryTree
The sum, over the nodes, of how much the node counts of the two subtrees differ.
Called as CombinatorialStat(x, "CollessIndex"). 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.
FindStat St001376
The Colless index of a binary tree.
| Object | Value |
|---|---|
[.,.] | 0 |
[.,[.,.]] | 1 |
[[.,.],.] | 1 |
[.,[.,[.,.]]] | 3 |
[.,[[.,.],.]] | 3 |
[[.,.],[.,.]] | 0 |
[[.,[.,.]],.] | 3 |
[[[.,.],.],.] | 3 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001376 has the rest.