binary tree = n!(2^n - n). for n =3 its 30. for BST its 2n

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

Answer Posted / rohit

binary tree = n!(2^n - n).
for n =3 its 30.

for BST its 2n
C * [1/(n+1)]
n
for n=3 its 5.

Is This Answer Correct ?

1 Yes

1 No

Please Help Members By Posting Answers For Below Questions

In what areas do data structures are applied?

946

What is the difference between list, set and map?

977

What is the use of sorting?

952

How to check array contains value or not?

942

Differentiate between set and map.

1153

What is the use of placement new?

1031

What is an array vs list?

853

Can we extend an array after initialization?

1052

What is the difference between one and two dimensional?

991

Is list a data structure?

953

What happens if we put duplicate key in hashmap?

852

Define degree of the node?

992

What are the tasks performed during postorder traversal?

943

Is hashmap faster than arraylist?

902

Difference between calloc and malloc ?

943