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 the best case for bubble sort?

855

List out the basic operations that can be performed on a stack?

876

What is the need of sorting?

907

What are basic algorithms?

894

What is arrays copyof?

861

Why using cookie to store session info is a better idea than just using session info in the request?

931

What is unhashable type list?

842

What is type structure?

862

What is the method to find the complexity of an algorithm?

1097

What is the purpose of thread?

951

Does hashmap allow null keys?

862

In what order the elements of a hashset are retrieved?

964

What is an acyclic graph?

1028

Tell me what is quick sort?

899

Is bubble sort faster than selection sort?

834