2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/216347We 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)).Combinatorics05C12, 20F38, 52B20text