edited by
31,602 views
29 votes
29 votes

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

  1. $1$
  2. $5$
  3. $4$
  4. $3$
edited by

3 Answers

Best answer
33 votes
33 votes

Can be found with formula... $(2nCn/n+1)$... $n$ being the number of nodes. for the given question... where $n=3$... answer is $5$. Let me also specify here.. that number of Binary Search Trees with $n$ nodes is equal to number of unlabeled Binary trees.

http://gatecse.in/wiki/Number_of_Binary_trees_possible_with_n_nodes

Correct Answer: $B$

edited by
0 votes
0 votes
Answer is 5.

By using 2ncn/(n+1) used for finding the number of unlabelled trees.
Answer:

Related questions

17 votes
17 votes
3 answers
2
26 votes
26 votes
4 answers
3
Kathleen asked Sep 21, 2014
25,722 views
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height $h$ is:$2^h -1$$2^{h-1} -1$$2^...