1 problem

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…