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 is a B tree?

1058

How can we reverse the order in the treemap?

933

What is linked list in data structure?

1067

Does arraylist shrink?

938

What are the types of data structures?

1207

Why do we need searching algorithms?

1162

Is an arraylist a vector?

1025

What are common data structures?

1072

What are the different data structures?

982

What is difference between hashtable and hashmap?

1128

Explain about the different lists available in the collection?

923

What is data structure definition?

930

How does dynamic memory allocation help in managing data?

1588

Do all declaration statements result in a fixed reservation in memory?

986

What are the disadvantages of sequential storage?

1302