Pitchforks on BinaryTree
The number of nodes whose subtree has exactly two nodes.
Called as CombinatorialStat(x, "Pitchforks"). 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 St000409
The number of pitchforks in a binary tree.
| Object | Value |
|---|---|
[.,.] | 0 |
[.,[.,.]] | 1 |
[[.,.],.] | 1 |
[.,[.,[.,.]]] | 1 |
[.,[[.,.],.]] | 1 |
[[.,.],[.,.]] | 0 |
[[.,[.,.]],.] | 1 |
[[[.,.],.],.] | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000409 has the rest.