Identifier
Values
[.,.] => [[],[]] => 0
[.,[.,.]] => [[],[[],[]]] => 1
[[.,.],.] => [[[],[]],[]] => 1
[.,[.,[.,.]]] => [[],[[],[[],[]]]] => 2
[.,[[.,.],.]] => [[],[[[],[]],[]]] => 2
[[.,.],[.,.]] => [[[],[]],[[],[]]] => 2
[[.,[.,.]],.] => [[[],[[],[]]],[]] => 2
[[[.,.],.],.] => [[[[],[]],[]],[]] => 2
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
Description
The number of internal nodes of an ordered tree.
A node is internal if it is neither the root nor a leaf.
Map
to complete tree
Description
Return the same tree seen as an ordered tree. By default, leaves are transformed into actual nodes.