Q3-iii

MSQMarks unknown

The number of rooted binary trees with $n$ nodes is,

(A)

Equal to the number of ways of multiplying $(n+1)$ matrices.

(B)

Equal to the number of ways of arranging $n$ out of $2 n$ distinct elements.

(C)

Equal to $\frac{1}{(n+1)}\binom{2n}{n}$ .

(D)

Equal to $n!$ .

Loading…