The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
282 views
3. The number of possible ordered trees with 3 nodes A, B, C is:
A)12

B)16

C)6

D)10
closed as a duplicate of: number of ordered trees
asked in Programming by Boss (40k points)
closed by | 282 views
+1
In case there are n nodes in a tree, then number of ordered trees(binary trees in which nodes are labelled) possible is (2nCn/(n+1))*n!
so according to the problem the answer should be 60
+1
(2nCn/(n+1))*n!=30 not 60 for n=3.
0
yes 30 is right.none of the  above is right

1 Answer

+1 vote
none of the above
answered by Loyal (6.9k points)

Related questions

0 votes
0 answers
4
asked Sep 28, 2018 in Programming by Vaishnavi01 (143 points) | 77 views
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,587 questions
54,197 answers
187,535 comments
71,151 users