MaximalLeftBranches on BinaryTree
The number of maximal paths of left edges.
A branch starts at a node with a left child that is not itself a left child.
Called as CombinatorialStat(x, "MaximalLeftBranches"). 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 St000919
The number of maximal left branches of a binary tree.
| Object | Value |
|---|---|
[.,[.,.]] | 0 |
[[.,.],.] | 1 |
[.,[.,[.,.]]] | 0 |
[.,[[.,.],.]] | 1 |
[[.,.],[.,.]] | 1 |
[[.,[.,.]],.] | 1 |
[[[.,.],.],.] | 1 |
[.,[.,[.,[.,.]]]] | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000919 has the rest.