Interested to Buy Any Domain ? << Click Here >> for more details...
how to find the number of possible tree in the given tree.
- 12 Answers
- 28388 Views
- Persistent, TCS, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
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.
| Is This Answer Correct ? | 179 Yes | 26 No |
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...
| Is This Answer Correct ? | 18 Yes | 0 No |
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
| Is This Answer Correct ? | 26 Yes | 9 No |
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.
| Is This Answer Correct ? | 1 Yes | 14 No |
Answer / rohit
Question is wrong XXXX
it should be how to find no. of distinct binary tree ????
ANSWER IS--- (1/(n+1))*2nCn
| Is This Answer Correct ? | 6 Yes | 22 No |
Answer / tauqueer
2^n-1
if n=3 then
answer= 2^3-1=7.
example..
1
2 2
3/ \3 3/ \3
| Is This Answer Correct ? | 4 Yes | 20 No |
Write a Program for Delete an element from a doubly linked list.
What is the difference between 1d and 2d array?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
Define a relation?
Can arraylist have duplicates?
How many parts are there in a declaration statement?
What do you mean by an Array?
Describe tree database. Explain its common uses.
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.
Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
What do you mean by separate chaining?
Windows 
