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

A 1
B 3
C 5
D 4

Correct Answer: 5

@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.
Bissoy MCQ
#তথ্য প্রযুক্তি #বাইনারি গণিত- Binary Math #Combined Bank (সমন্বিত ব্যাংক) #Sonali & Janata Bank | Officer (IT)| 04.01.2019

Related Questions

The maximum number of binary trees that can be formed with three unlabeled nodes is:
A 1
B 3
C 5
D 4
Sue planted 4 times as many apple seeds as she planted orange seeds. 15% of the apple seeds grew into trees, and 10% of the orange seeds grew into trees. If a total of 420 apple trees and orange trees grew from the seeds, how many orange seeds did Sue plant?
A 540
B 600
C 660
D 720
A gardener plants 17956 trees in such a way that there are as many rows as the number of trees in a row. What is the number of trees in a row ?
A 134
B 136
C 144
D 154
Rahim has invited his three buddies over to watch the basketball game on his wide-screen television. They are all hungry, but no one wants to leave to get food. Just as they are arguing about who should make the food run, a commercial comes on for a local pizzeria that delivers. The phone number flashes on the screen briefly and they all try to remember it. By the time Zachary grabs a pen and paper, each of them recollects a different number.i. All of the men agree that the first three numbers are 995.ii. Three of them agree that the fourth number is 9.iii. Three agree that the fifth number is 2.iv. Three agree that the sixth number is 6; three others agree that the seventh number is also 6.Which of the numbers is most likely the telephone number of the pizzeria?
A 995-9266
B 995-9336
C 995-9268
D 995-8266
10 men can cut 15 trees in 2 hours. If 2 men leave the job, how many trees will be cut in 3 hours?
A 20 trees
B 18 trees
C 24 trees
D None of these
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
A O(1)
B O(long)
C O(n)
D O(long)
In a row of trees is 7th from the left and 14th from the right end. How many trees are there in the row?
A 19
B 18
C 21
D 20
In a garden , there are 10 rows and 12 columns of trees . The distance between any two trees is 2 m and a distance of 1 m is left from all sides of the boundary of the garden . What is the length of garden?
A 20 m
B 22m
C 23 m
D 24 m
In a garden, there are 10 rows and 12 columns of mango trees. The distance between two trees is 2 meters and a distance of one meter left from all sides of the boundary of the garden. What is the length of the garden?
A 20m
B 22m
C 24m
D 26m
In a garden, there are 10 rows and 12 columns of mango trees. The distance between two trees is 2 meters and a distance of one meter is left from all sides of the boundary of the garden. What is the length of the garden ?
A 20 m
B 22 m
C 24 m
D 26 m

Next steps