Interested to Buy Any Domain ? << Click Here >> for more details...
how to find the number of possible tree in the given tree.
- 12 Answers
- 28392 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
Define an algorithm. What are the types of algorithms?
Can a class have a constructor?
Explain Array
What is meant by deque?
Differentiate between an array and an arraylist.
What is a dequeue?
Define heap?
How efficient is bubble sort?
Define balance factor of a node in avl tree?
What is array and string?
How does a selection sort work for an array?
What sorting algorithm should be used for sorting strings?
What is the difference between push and pop?
How many types of linked lists are there?
What is difference between for loop and foreach?
