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

What are data and data types?

1118

What is merge sort in daa?

926

Can array store heterogeneous data?

891

How to inverting a function in sort and searching?

1058

What do you mean by structure property in a heap?

1126

Explain exception filter?

1017

Can we override compareto method for enumerations?

1059

What is the difference between hashmap and treemap?

968

What is doubly linked list in data structure?

880

Why is hashset not ordered?

1045

Why do we need linked lists?

986

What is the need for path compression?

1153

What are the main differences between the linked list and linear array?

1028

What is the impact of signed numbers on the memory?

983

Can you please explain the difference between array_name and &array_name?

1038