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
- 16604 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 difference between stack and queue?
Which type of memory allocation is referred for linked list?
State the rules to be followed during infix to prefix conversions?
Describe the types of data structures?
Can treemap key null?
What is an expression tree?
What is best time complexity?
Define linked list data structure.
Explain extended binary tree.
What is the difference between arraylist and array?
What is 2 dimensional linked list?
What is breadth first tree?
Mention the steps to insert data at the starting of a singly linked list?
How can we reverse the order in the treemap?
Is hashmap a data structure?
