Share
Explore BrainMass

Catalan Numbers

Prove recurrence relationship of Catalan Numbers.

Question: Let n be a non-negative integer. The number, x[n], of topologically distinct binary trees with n nodes can be shown to satisfy the following recurrence (x[0] = 1):

See attached file for full problem description.

Attachments

$2.19