2 problems

Let $G$ be a complete binary tree on $n$ vertices, and let $\mathcal{R}(G)$ be its rotation graph, whose vertices are the search trees on $G$ and whose edges correspond to single r…

Let $n=2p-1$ or $n=2p$ and define the binary trees … and … Here $\operatorname{dist}(T,T')$ denotes the rotation distance between binary trees $T$ and $T'$. The maximal rotation di…