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
- 16405 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 long data type?
Which is faster hashmap or hashtable?
What is return map?
What is a Stack? Explain with example?
Why is bubble sort stable?
Differentiate between list and map.
Define the tree data structure.
What exactly is a thread?
What are the types of algorithms?
What is the use of isEmpty() member methods?
Explain binary tree traversals?
Can you declare an array without assigning the size of an array?
How many types of sorting algorithms are there?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
What is rule regarding overriding equals and hascode method?
