number of binary search tree= (2n)!/{n!*(n+1)!} and number of binary tree=

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 / vipul

Answer Posted / vipul

number of binary search tree= (2n)!/{n!*(n+1)!}
and number of binary tree=(2n)!/(n+1)!

Is This Answer Correct ?

3 Yes

0 No

Please Help Members By Posting Answers For Below Questions

What are the goals of data structure?

1190

Define static data structures?

941

What do you mean by union-by-weight?

954

Describe the height term in a tree.

937

What is heap and its types?

899

what is Linked lists?

942

What are the advantages of linked list over array (static data structure)?

1285

Why do we use insertion sort?

819

What is meant by strongly connected in a graph?

883

What are hashmaps good for?

853

How does a treemap work?

945

How much time does it take to learn data structures?

872

What does the term sorting refer to?

1016

Why do we use linked lists?

841

Why do we study data structures?

876