how to find the number of possible tree in the given tree.
- 12 Answers
- 25515 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
Write an algorithm to find middle element in the linked list.
What is the height of a binary tree?
What is heap tree in data structure?
What is the difference between 1d and 2d array?
Which sorting algorithm is best for small data?
Where the data structures are used?
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
What is stack explain with diagram?
Explain what are the major data structures used in the hierarchical data model?
What is return map?
What is a Breadth First Search? Give a few of its applications.
Is arraylist a class?
What is a circular singly linked list?
Does list maintain insertion order?
Describe binary tree and its property.
