COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The maximum number of binary trees that can be formed with three nodes
|
|
3
|
|
|
1
|
|
|
5
|
|
|
4
|
Explanation:
Detailed explanation-1: -So, with three nodes, there will be five distinct unlabelled binary trees that can be created.
Detailed explanation-2: -For n = 5–> 42 Binary Search Trees are possible. For n = 6–> 132 Binary Search Trees are possible.
Detailed explanation-3: -Hence the correct answer is 120.
There is 1 question to complete.