  It is proved that the average number of segments on the right branch of a
binary tree of size n tends to 3 as n tends to $\infty$. Also the fraction of
trees with k segments on the right branch from all trees of size n tends to
$\frac{k}{2^{k+1}}$ as n tends to $\infty$
