Step 1: The number of unrooted binary trees for \(n\) taxa is \((2n-5)!!\). For \(n=4\), \((2\cdot4-5)!!=3!!=3\), matching the given. Step 2: The number of rooted binary trees for \(n\) taxa is \((2n-3)!!\). Thus, for \(n=4\):
\[
(2\cdot4-3)!!=5!!=5\cdot3\cdot1=\boxed{15}.
\]
Was this answer helpful?
0
0
Top Questions on Bioinformatics resources and search tools