how to find the number of possible tree in the given tree.
- 12 Answers
- 23896 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
List the abstract operations in the set?
Define linked list data structure.
What is array and string?
Why do we need sorting algorithms?
What is array indexing?
Define tree edge?
Write a program to reverse a single linked list.
Does treemap allow null key?
What is the difference between classifying and sorting?
What is linear-logarithm chasm?
What do you mean by Syntax Error
How does max heap work?
What is collection process?
When will we get ArrayStoreException?
What is structure of data type?
