edited by
980 views

2 Answers

1 votes
1 votes

Since its not mentioned whether the nodes are labelled or not, so taking un-labelled nodes in general,

maximum number of binary trees = 2nCn / n+1 

This gives 14 binary trees which is option C

1 votes
1 votes

$\textit{There is one binary tree with one node. }$

$\textit{There are two differently shaped trees with two nodes. }$

$\textit{There are 14 different (shaped) binary trees with four nodes.}$

$\textit{These different trees are shown below.}$

 

Ref: https://courses.cs.duke.edu/fall03/cps100/assign/writtentree/

https://www.geeksforgeeks.org/total-number-of-possible-binary-search-trees-with-n-keys/

Answer:

Related questions

2 votes
2 votes
1 answer
1
admin asked Apr 1, 2020
1,039 views
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$$2^{h-1} ...
1 votes
1 votes
2 answers
2
admin asked Apr 1, 2020
687 views
Which of the following is useful in traversing a given graph by breadth first search?StackSetListQueue
1 votes
1 votes
2 answers
3
admin asked Apr 1, 2020
3,643 views
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$$O(n),O(1)$$O(1),O(n)$$O(1),O(1)$
1 votes
1 votes
2 answers
4