Formula For BST is {(2n)!/(n!*n)}/(n+1) So for N=1 BST=1 N=2 BST=2 N=

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 / hazrat hussain

Answer Posted / hazrat hussain

Formula For BST is
{(2n)!/(n!*n)}/(n+1)
So for
N=1 BST=1
N=2 BST=2
N=3 BST=5
N=4 BST=14
N=5 BST=42
and so on

Is This Answer Correct ?

1 Yes

0 No

Please Help Members By Posting Answers For Below Questions

Describe the complexity of Binary search

912

What are different types of algorithms?

895

Is linked list faster than array?

859

What is a dequeue?

974

Can you make an arraylist of arrays?

1095

What happens if we try to insert duplicate key in hashmap?

825

What is difference between concurrenthashmap and hashtable?

927

What is difference between list and set?

842

Define an algorithm. What are the properties of an algorithm?

1067

What is the use of heap sort?

837

Tell me the difference between structure and array?

991

What is inserting in data structure?

966

Explain extended binary tree.

970

Define indegree of a graph?

1081

What are the average and worst time complexity in a sorted binary tree is

971