Interested to Buy Any Domain ? << Click Here >> for more details...
Q#1: An algorithm is made up of 2 modules M1 and M2.If
order of M1 is F(n) and order of M2 is g (n) then what is
the order of the algorithm.
Q # 2 : How many binary trees are possible with 3 nodes?
with 4 nodes?
- 4 Answers
- 16454 Views
- I also Faced
- E-Mail Answers
Answer Posted / mousumi
no of binary trees possible with n nodes is 2^n-n
3->2^3-3=5 nodes
4->2^4-4=12 nodes
| Is This Answer Correct ? | 2 Yes | 4 No |
Post New Answer View All Answers
What is ds heap sort?
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
Can hashmap be sorted?
Define biconnectivity?
Which is faster list or set?
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?
Can you store different types in an array?
What is weight balanced tree in data structure?
how to add an item to the beginning of the list?
Is any implicit arguments are passed to a function when it is called?
Is arraylist heterogeneous?
Differentiate between list and set.
Is quicksort a stable sorting algorithm?
What will be the output of below code?
What is linear-logarithm chasm?
