Assertion: tree's number | /r/HasProperty | equal
Facets:
value: among labeled bifurcating trees
type: OTHER
value: to the number of ways
type: OTHER
Source sentences:
text: The number of such binary trees of size n is equal to the number of ways of fully parenthesizing a string of n + 1 symbols (representing leaves) separated by n binary operators (representing internal nodes), so as to determine the argument subexpressions of each operator.
text: Among labeled bifurcating trees, the number of unrooted trees with n {\displaystyle n} leaves is equal to the number of rooted trees with n − 1 {\displaystyle n-1} leaves.