Interested to Buy Any Domain ? << Click Here >> for more details...
how to find the number of possible tree in the given tree.
- 12 Answers
- 27524 Views
- Persistent, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Why sorting is done?
What is difference between tree and forest?
What is two-dimensional array?
Is array static or dynamic?
Can you tell me the differences between Array and ArrayList?
What is unhashable type list?
Can treemap have duplicate values?
Define hash function?
Is hashtable better than dictionary?
Is arraylist a class?
write an algorithm to show the procedure of insertion into a b-tree?
Define primary data structures?
What is bubble sort with example?
Is hashset a collection?
How many types of linked list exist?
