Interested to Buy Any Domain ? << Click Here >> for more details...
how to find the number of possible tree in the given tree.
- 12 Answers
- 28033 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
Are hash tables ordered?
Describe the types of data structures?
What is the difference between ienumerable and list?
which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?
Is linkedlist thread safe?
Is collection a class or interface?
Why might quick sort might be better than merge sort?
Mention the steps to insert data at the starting of a singly linked list?
What is complete binary tree in data structure?
Write program for Bubble Sort ?
What is application of data structure?
What are examples of data structures?
What is copyonwritearraylist?
Where is binary tree used?
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
