Identifier
Values
[.,.] => [[],[]] => 1
[.,[.,.]] => [[],[[],[]]] => 2
[[.,.],.] => [[[],[]],[]] => 2
[.,[.,[.,.]]] => [[],[[],[[],[]]]] => 3
[.,[[.,.],.]] => [[],[[[],[]],[]]] => 3
[[.,.],[.,.]] => [[[],[]],[[],[]]] => 2
[[.,[.,.]],.] => [[[],[[],[]]],[]] => 3
[[[.,.],.],.] => [[[[],[]],[]],[]] => 3
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 depth minus 1 of an ordered tree.
The ordered trees of size $n$ are bijection with the Dyck paths of size $n-1$, and this statistic then corresponds to St000013The height of a Dyck path..
Map
to complete tree
Description
Return the same tree seen as an ordered tree. By default, leaves are transformed into actual nodes.