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

Is vector a collection?

919

Are the expressions arr and &arr same for an array of integers?

1047

What are splay trees?

1034

What are stacks? Give some of its applications.

1042

What is difference between array and string?

1063

Differentiate between singly and doubly linked lists?

1049

Define left-in threaded tree?

922

Define structure property in a heap?

1037

Is stack a dynamic data structure?

953

What do you mean by shortest path?

1105

Can array store heterogeneous data?

891

Explain the term base case?

974

When will you use array over arraylist?

1012

Why is selection sort used?

945

List the types of tree.

950