There exist two binary trees with rotation distance $2n-6$. The proof is unexpected and based on hyperbolic geometry (Sleator, Tarjan, Thurston (1988), "Rotation distance, triangulations, and hyperbolic geometry").
|
1 | [made Community Wiki] | ||
|
|
||||
