how to find the number of possible tree in the given tree.
Answer Posted / tauqueer
2^n-1
if n=3 then
answer= 2^3-1=7.
example..
1
2 2
3/ \3 3/ \3
| Is This Answer Correct ? | 4 Yes | 20 No |
Post New Answer View All Answers
What is stack and its operations?
Which are the sorted collections?
What are the properties of an algorithm?
What are the different types of data structures explain briefly?
What are different dynamic memory allocation technique in c.
What are linked list?
Which is better selection or bubble sort?
State the demerits of linked representation of binary trees?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
State the different types of linked lists?
What are the basic operations of stack?
Can we insert null in hashset?
Differentiate between hashset and hashmap.
Can arraylist store int?
What is collection process?