Catalan Number On:of full binary trees with n+1 leaves 个公公 Recursion: Ck Cn-1-k Co=1forn≥1， m-1 Cn=∑CCn-1-k k=0Cn = n ￾￾1 k=0 CkCn￾1￾k C0 = 1 for n ￾ 1, Ck Cn￾1￾k Cn : # of full binary trees with n+1 leaves Catalan Number Recursion: