OFFSET
0,3
COMMENTS
This bijection of binary trees is obtained in the following way. (Inverse of Thompson's B!):
.B...C...............C...D
..\./.................\./
...x...D....-->....B...x.................()..C ........A...()
....\./.............\./...................\./....-->....\./...
.A...x...........A...x.................A...x.........C...x....
..\./.............\./...................\./...........\./.....
...x...............x.....................x.............x......
..............................................................
That is, (a . ((b . c) . d)) -> (a . (b . (c . d)))
or (a . (() . c)) -> (c . (a . ())) if the former is not possible.
LINKS
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 06 2009
STATUS
approved