2 problems

Let ${\mathcal S}$ and ${\mathcal T}$ be balanced rooted binary phylogenetic $X$-trees, meaning that each has $2^m$ leaves for some non-negative integer $m$ and height $m$, and let…

Let $T_1$ and $T_2$ be balanced, rooted, binary trees of height $m$. An agreement subtree is a common subtree of the two trees on a shared set of leaves. The square-root agreement-…