`TreesMatchingTree()`

calculates the number of unrooted binary trees that
are consistent with a tree topology on the same leaves.

```
TreesMatchingTree(tree)
LnTreesMatchingTree(tree)
Log2TreesMatchingTree(tree)
```

- tree
A tree of class

`phylo`

.

`TreesMatchingTree()`

returns a numeric specifying the number of
unrooted binary trees that contain all the edges present in the input tree.
`LnTreesMatchingTree()`

gives the natural logarithm of this number.

Remember to unroot a tree first if the position of its root is arbitrary.

Other tree information functions:
`CladisticInfo()`

,
`NRooted()`

```
partiallyResolvedTree <- CollapseNode(BalancedTree(8), 12:15)
TreesMatchingTree(partiallyResolvedTree)
#> [1] 45
LnTreesMatchingTree(partiallyResolvedTree)
#> [1] 3.806662
# Number of rooted trees:
rootedTree <- AddTip(partiallyResolvedTree, where = 0)
TreesMatchingTree(partiallyResolvedTree)
#> [1] 45
```