  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)).
