Identifier
Values
[+] => [1] => [.,.] => [[],[]] => 2
[-] => [1] => [.,.] => [[],[]] => 2
[+,+] => [1,2] => [.,[.,.]] => [[],[[],[]]] => 2
[-,+] => [1,2] => [.,[.,.]] => [[],[[],[]]] => 2
[+,-] => [1,2] => [.,[.,.]] => [[],[[],[]]] => 2
[-,-] => [1,2] => [.,[.,.]] => [[],[[],[]]] => 2
[2,1] => [2,1] => [[.,.],.] => [[[],[]],[]] => 2
[+,+,+] => [1,2,3] => [.,[.,[.,.]]] => [[],[[],[[],[]]]] => 2
[-,+,+] => [1,2,3] => [.,[.,[.,.]]] => [[],[[],[[],[]]]] => 2
[+,-,+] => [1,2,3] => [.,[.,[.,.]]] => [[],[[],[[],[]]]] => 2
[+,+,-] => [1,2,3] => [.,[.,[.,.]]] => [[],[[],[[],[]]]] => 2
[-,-,+] => [1,2,3] => [.,[.,[.,.]]] => [[],[[],[[],[]]]] => 2
[-,+,-] => [1,2,3] => [.,[.,[.,.]]] => [[],[[],[[],[]]]] => 2
[+,-,-] => [1,2,3] => [.,[.,[.,.]]] => [[],[[],[[],[]]]] => 2
[-,-,-] => [1,2,3] => [.,[.,[.,.]]] => [[],[[],[[],[]]]] => 2
[+,3,2] => [1,3,2] => [.,[[.,.],.]] => [[],[[[],[]],[]]] => 2
[-,3,2] => [1,3,2] => [.,[[.,.],.]] => [[],[[[],[]],[]]] => 2
[2,1,+] => [2,1,3] => [[.,.],[.,.]] => [[[],[]],[[],[]]] => 2
[2,1,-] => [2,1,3] => [[.,.],[.,.]] => [[[],[]],[[],[]]] => 2
[2,3,1] => [2,3,1] => [[.,.],[.,.]] => [[[],[]],[[],[]]] => 2
[3,1,2] => [3,1,2] => [[.,[.,.]],.] => [[[],[[],[]]],[]] => 2
[3,+,1] => [3,2,1] => [[[.,.],.],.] => [[[[],[]],[]],[]] => 2
[3,-,1] => [3,2,1] => [[[.,.],.],.] => [[[[],[]],[]],[]] => 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 maximum number of child nodes in a tree.
Map
to complete tree
Description
Return the same tree seen as an ordered tree. By default, leaves are transformed into actual nodes.
Map
binary search tree: left to right
Description
Return the shape of the binary search tree of the permutation as a non labelled binary tree.
Map
permutation
Description
The underlying permutation of the decorated permutation.