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

How to cut or remove an element from the array?

920

Is there any difference between int[] a and int a[]?

1068

What is a map in programming?

823

What are basic algorithms?

853

Can treemap key null?

983

What are the different types of hash functions?

892

What is Insertion sort, selection sort, bubble sort( basic differences among the functionality of the three sorts and not the exact algorithms)?

899

What is difference between array and string?

934

Can hashset contain duplicates?

899

What is sequential search? What is the average number of comparisons in a sequential search?

766

Does treemap preserve order?

798

Can we change the size of an array at run time?

918

What do you mean by recursive definition?

874

How do you find the complexity of a selection sort?

835

If you are using c language to implement the heterogeneous linked list, what pointer type should be used?

1009