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
- 15134 Views
- I also Faced
- E-Mail Answers
Answer Posted / sriram
order of the algorithm is f(n)+g(n)
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 ? | 4 Yes | 15 No |
Post New Answer View All Answers
Which interface provides the capability to store objects using a key-value pair?
Why is sorting necessary?
Why do we use hashset?
How do you search for a target key in a linked list?
What is quick sort?
What are the different types of data structures explain briefly?
What is binary tree? Explain its uses.
What is bubble sort?
Explain the common uses of threaded binary tree.
Define dynamic data structures?
Define terminal nodes in a tree?
Why do we use different types of data structures?
Does treemap allow null values?
What are the tasks performed during preorder traversal?
What are the disadvantages of circular list?
