Answer / baskerdearer

number of possible tree = (2 power n) - n.
for example:
A tree contain three node.
so n=3.
possible tree = 8 - 3 = 5.

Answer / mandeep

the formula is (2^n)-n.
where n=no.of nodes

Answer / vikram_tp

you all are going wrong...
the formula which u have given is only working when n=2 or 3..
bt when n=4 the ans should be 14 not 12
when n=5 ans is 42 and not what comes by the formula...
so there isnt any formula for this..u have to count then by generating the trees by urself...

Answer / m.vinothkumar

no. of possible trees=(2^n)-n.
where n=no.of nodes

I FOUNDED THIS CORRECT FORMULA FROM GRAPHICS FROM
MATHEMATICS BOOK

Answer / himani

(2^n)-n. where n is no. of nodes

Answer / xyz

2^n-n

Answer / sudip

If there are 3 nodes A,B and C. In which A is root and B and
C are it's left and right child...
Then if we want to count the no. of tree..then..

A A A A-alone, B -alone and
/ \ / \ C-alone and the last
B C B C one is null tree.


I think there will be 7 subtrees if we null is subtree then,..

no. of tree = 2^n - 1.

Answer / rohit

Question is wrong XXXX
it should be how to find no. of distinct binary tree ????

ANSWER IS--- (1/(n+1))*2nCn

Answer / tauqueer

2^n-1
if n=3 then
answer= 2^3-1=7.

example..
1
2 2
3/ \3 3/ \3

Answer / gaurav tripathi

2n-n

What is sequential sorting?

0 Answers  

Define in brief an array. What are the types of array operations?

0 Answers  

What is definition list?

0 Answers  

Can we add heterogeneous elements into treemap?

0 Answers  

What does abstract data type means?

23 Answers   College School Exams Tests, Infosys, SBIT, TCS,

What is structured data with example?

0 Answers  

Define a set?

0 Answers  

What is a directed graph?

0 Answers  

Is quicksort a stable algorithm?

0 Answers  

Write the procedure to convert general tree to binary tree?

0 Answers  

Explain the difference between hashset and hashmap?

0 Answers  

What is a graph?

0 Answers