Interested to Buy Any Domain ? << Click Here >> for more details...
how to find the number of possible tree in the given tree.
- 12 Answers
- 27951 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
What do you mean by disjoint set adt?
Explain what are the major data structures used in the rdbms?
How to inverting a function in sort and searching?
What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks
Can you change size of array once created?
How does selection sort work?
What is return map?
How do you sort a list in reverse order?
Which is better arraylist or linkedlist?
What is the capacity of arraylist?
How expression trees are gets represented in data structure?
What is difference between hashmap and arraylist?
What exactly is a thread?
Why quicksort is faster?
Which is faster treemap or hashmap?
