binary search tree=(2^n)-n i.e (2^3)-3=5 binary tree=((2^n)-n)*n! i.e ((2^

How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?

Question Posted / shalini

Answer Posted / shalini

binary search tree=(2^n)-n i.e (2^3)-3=5
binary tree=((2^n)-n)*n! i.e ((2^3)-3)*3!=30

this is the right answer!!!!

Is This Answer Correct ?

2 Yes

4 No

Please Help Members By Posting Answers For Below Questions

In an avl tree, at explain what condition the balancing is to be done?

947

Does arraylist maintain insertion order?

820

Define an algorithm. What are the types of algorithms?

1006

What are the applications of stack?

894

What is the difference between push and pop?

1094

What is the time complexity of arraylist and linked list?

910

Why do we use trees in data structures?

890

What is the default size of arraylist?

957

What are the Advantages and disadvantages of Array?

1142

What is the purpose of sorting?

907

What thread means?

888

Why would you use a linked list?

908

When is a graph said to be weakly connected?

993

Can you list out the areas in which data structures are applied extensively?

1005

What is sorting an array?

897