%0 Journal Article
%T On the rotation distance between binary trees
%A Patrick Dehornoy
%J Mathematics
%D 2009
%I arXiv
%X We develop combinatorial methods for computing the rotation distance between binary trees, i.e., equivalently, the flip distance between triangulations of a polygon. As an application, we prove that, for each n, there exist size n trees at distance 2n - O(sqrt(n)).
%U http://arxiv.org/abs/0901.2557v1