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
- 16448 Views
- I also Faced
- E-Mail Answers
Answer Posted / sriram
iam sorry i had given the wrong answer above....
its O(f(n)*g(n)) or O(max(f(n),g(n))
2^n -n so its 5 and 12 nodes respectively.....
| Is This Answer Correct ? | 34 Yes | 3 No |
Post New Answer View All Answers
Define depth and height of a tree?
Is bucket sort stable?
State the demerits of linked representation of binary trees?
Why null is not allowed in treemap?
Which is better than array and linked list?
How to reference all the elements in a one-dimension array?
Differentiate linear from non linear data structure?
How remove all from arraylist?
What is the difference between a Stack and a Queue.
where do you use double linked list?
Does treeset remove duplicates?
What should I learn first data structures or algorithms?
Describe what is Node in link list? And name the types of Linked Lists?
What is complete binary tree and almost complete binary tree?
What is an recursive algorithm?
