Question { Qualcomm, 34497 }
Given n nodes. Find the number of different structural
binary trees that can be formed using the nodes.
Answer
No. of labeled binary tree :
n^(n-2)
No. unlabeled binary tree :
(2n)!/[(n+1)!.n!] (this is known as catlon number)