Discuss Forum
1.
The maximum number of binary trees that can be formed with three unlabeled nodes is:
- A. 1
- B. 1
- C. 1
- D. 1
Answer: Option C
Explanation:
@SOLUTION;__✍️ BST(n) = C(2*n , n) / (n + 1) Therefore Unlabeled BT(n) = C(2*n , n) / (n + 1) Therefore the number of unlabeled BT with 3 nodes is given by:— = > C(2*3, 3) /(3 + 1) = > C(6,3)/4 = > 6!/(3!*3!*4) = > 6*5/6 = > 5 So the number of unlabeled Binary Tree with 3 nodes is 5.
Post your comments here: