no of binary trees possible with n nodes is 2^n-n 3->2^3-3=5 nodes

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?

Question Posted / mousumi

4 Answers
16267 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

Please Help Members By Posting Answers For Below Questions

What are hash tables good for?

859

What is the space complexity of selection sort?

893

Explain implementation of deletion from a binary tree.

915

What is a spanning tree in data structure?

915

How to find the missing element in integer array of 1 to 7?

898

What is stack and its operations?

800

Why quicksort is called quick?

861

What is a data structure definition?

903

What is significance of ” * ” ?

975

Can we declare array size as a negative number?

953

Is a hashmap a dictionary?

817

What is ascii sort order?

852

What is a simple path?

942

What are the advantages of modularity?

899

What is the difference between hashset and treeset?

925