Identifier
- St000051: Binary trees ⟶ ℤ
Values
[.,.] => 0
[.,[.,.]] => 0
[[.,.],.] => 1
[.,[.,[.,.]]] => 0
[.,[[.,.],.]] => 0
[[.,.],[.,.]] => 1
[[.,[.,.]],.] => 2
[[[.,.],.],.] => 2
[.,[.,[.,[.,.]]]] => 0
[.,[.,[[.,.],.]]] => 0
[.,[[.,.],[.,.]]] => 0
[.,[[.,[.,.]],.]] => 0
[.,[[[.,.],.],.]] => 0
[[.,.],[.,[.,.]]] => 1
[[.,.],[[.,.],.]] => 1
[[.,[.,.]],[.,.]] => 2
[[[.,.],.],[.,.]] => 2
[[.,[.,[.,.]]],.] => 3
[[.,[[.,.],.]],.] => 3
[[[.,.],[.,.]],.] => 3
[[[.,[.,.]],.],.] => 3
[[[[.,.],.],.],.] => 3
[.,[.,[.,[.,[.,.]]]]] => 0
[.,[.,[.,[[.,.],.]]]] => 0
[.,[.,[[.,.],[.,.]]]] => 0
[.,[.,[[.,[.,.]],.]]] => 0
[.,[.,[[[.,.],.],.]]] => 0
[.,[[.,.],[.,[.,.]]]] => 0
[.,[[.,.],[[.,.],.]]] => 0
[.,[[.,[.,.]],[.,.]]] => 0
[.,[[[.,.],.],[.,.]]] => 0
[.,[[.,[.,[.,.]]],.]] => 0
[.,[[.,[[.,.],.]],.]] => 0
[.,[[[.,.],[.,.]],.]] => 0
[.,[[[.,[.,.]],.],.]] => 0
[.,[[[[.,.],.],.],.]] => 0
[[.,.],[.,[.,[.,.]]]] => 1
[[.,.],[.,[[.,.],.]]] => 1
[[.,.],[[.,.],[.,.]]] => 1
[[.,.],[[.,[.,.]],.]] => 1
[[.,.],[[[.,.],.],.]] => 1
[[.,[.,.]],[.,[.,.]]] => 2
[[.,[.,.]],[[.,.],.]] => 2
[[[.,.],.],[.,[.,.]]] => 2
[[[.,.],.],[[.,.],.]] => 2
[[.,[.,[.,.]]],[.,.]] => 3
[[.,[[.,.],.]],[.,.]] => 3
[[[.,.],[.,.]],[.,.]] => 3
[[[.,[.,.]],.],[.,.]] => 3
[[[[.,.],.],.],[.,.]] => 3
[[.,[.,[.,[.,.]]]],.] => 4
[[.,[.,[[.,.],.]]],.] => 4
[[.,[[.,.],[.,.]]],.] => 4
[[.,[[.,[.,.]],.]],.] => 4
[[.,[[[.,.],.],.]],.] => 4
[[[.,.],[.,[.,.]]],.] => 4
[[[.,.],[[.,.],.]],.] => 4
[[[.,[.,.]],[.,.]],.] => 4
[[[[.,.],.],[.,.]],.] => 4
[[[.,[.,[.,.]]],.],.] => 4
[[[.,[[.,.],.]],.],.] => 4
[[[[.,.],[.,.]],.],.] => 4
[[[[.,[.,.]],.],.],.] => 4
[[[[[.,.],.],.],.],.] => 4
[.,[.,[.,[.,[.,[.,.]]]]]] => 0
[.,[.,[.,[.,[[.,.],.]]]]] => 0
[.,[.,[.,[[.,.],[.,.]]]]] => 0
[.,[.,[.,[[.,[.,.]],.]]]] => 0
[.,[.,[.,[[[.,.],.],.]]]] => 0
[.,[.,[[.,.],[.,[.,.]]]]] => 0
[.,[.,[[.,.],[[.,.],.]]]] => 0
[.,[.,[[.,[.,.]],[.,.]]]] => 0
[.,[.,[[[.,.],.],[.,.]]]] => 0
[.,[.,[[.,[.,[.,.]]],.]]] => 0
[.,[.,[[.,[[.,.],.]],.]]] => 0
[.,[.,[[[.,.],[.,.]],.]]] => 0
[.,[.,[[[.,[.,.]],.],.]]] => 0
[.,[.,[[[[.,.],.],.],.]]] => 0
[.,[[.,.],[.,[.,[.,.]]]]] => 0
[.,[[.,.],[.,[[.,.],.]]]] => 0
[.,[[.,.],[[.,.],[.,.]]]] => 0
[.,[[.,.],[[.,[.,.]],.]]] => 0
[.,[[.,.],[[[.,.],.],.]]] => 0
[.,[[.,[.,.]],[.,[.,.]]]] => 0
[.,[[.,[.,.]],[[.,.],.]]] => 0
[.,[[[.,.],.],[.,[.,.]]]] => 0
[.,[[[.,.],.],[[.,.],.]]] => 0
[.,[[.,[.,[.,.]]],[.,.]]] => 0
[.,[[.,[[.,.],.]],[.,.]]] => 0
[.,[[[.,.],[.,.]],[.,.]]] => 0
[.,[[[.,[.,.]],.],[.,.]]] => 0
[.,[[[[.,.],.],.],[.,.]]] => 0
[.,[[.,[.,[.,[.,.]]]],.]] => 0
[.,[[.,[.,[[.,.],.]]],.]] => 0
[.,[[.,[[.,.],[.,.]]],.]] => 0
[.,[[.,[[.,[.,.]],.]],.]] => 0
[.,[[.,[[[.,.],.],.]],.]] => 0
[.,[[[.,.],[.,[.,.]]],.]] => 0
[.,[[[.,.],[[.,.],.]],.]] => 0
[.,[[[.,[.,.]],[.,.]],.]] => 0
[.,[[[[.,.],.],[.,.]],.]] => 0
>>> Load all 196 entries. <<<
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 size of the left subtree of a binary tree.
Code
def statistic(T):
return T[0].node_number()
Created
Mar 25, 2013 at 11:24 by Viviane Pons
Updated
Oct 17, 2015 at 10:47 by Christian Stump
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!