Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

Programming and data structure miscellaneous

Programming & Data Structure

  1. The maximum number of binary trees that can be formed with three unlabelled nodes is
    1. 1
    2. 5
    3. 4
    4. 3
Correct Option: B

It is given that n = 3

1
2nCn
n + 1

1
6C3
3 + 1

1.6!
= 5
4 × 3!3!

Therefore, there are 5 trees that can be formed with three unlabelled node.



Your comments will be displayed only after manual approval.