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

Why would you use a linked list?

911

What is difference between list and set?

827

Which collection is fail safe?

862

Is arraylist a class?

976

Why is hashmap faster than arraylist?

1010

What is a Queue? Explain its operation with example?

991

Run time memory allocation is known as in data structure?

941

What is the difference between hashset and arraylist?

971

Define the tree data structure.

879

How do you check if a stack is empty or not?

837

what is a balanced tree.

978

What is difference between an Array and ArrayList?

1001

What is entryset in hashmap?

899

Different Types of pattern?

960

Can we use ordered set for performing binary search?

907