The Catalan Numbers should give an answer.. The answer is C(3)= 5.

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

Answer Posted / gautham

The Catalan Numbers should give an answer.. The answer is
C(3)= 5.

Is This Answer Correct ?

48 Yes

21 No

Please Help Members By Posting Answers For Below Questions

Are lists mutable?

953

What are data members?

974

How many sorting algorithms are there?

1008

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

1346

How do you sort in ascending order in arraylist?

874

What are different types of sorting algorithms?

1013

Define degree of the node?

1009

Which is better hashmap or hashtable?

931

How will you explain circular linked list?

915

What are the advantages of linked list over an array?

948

How to create an Array?

980

What is a minimum spanning tree?

1083

How many parts are there in a declaration statement using data structures?

1002

Is file a data structure?

979

How does a treemap work?

1002