Data Structures | Binary Trees | Question 6

The maximum number of binary trees that can be formed with three unlabelled nodes is:

(A)

1

(B)

5

(C)

4

(D)

3

Answer: (B)
Explanation:

Certainly, here’s the revised presentation of the unlabeled binary trees:

Note that nodes are unlabeled. If the nodes are labeled, we get more trees. We can find the number of binary tree by Catalan numbers. Here n = 3 Number of binary tree = (²ⁿC_n)/ n+1 = (^2*3C₃)/ 3+1 = 5. So, option (B) is correct.

Quiz of this Question
Please comment below if you find anything wrong in the above post