(2n C n) / (n+1) is the Number of BST if N is the number of integer/value

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 / shekhar

Answer Posted / shekhar

(2n C n) / (n+1) is the Number of BST if N is the number of
integer/value;

Is This Answer Correct ?

17 Yes

8 No

Please Help Members By Posting Answers For Below Questions

What is difference between arraylist and list?

928

What are the topics in data structures?

1015

Can we put null value in hashmap?

881

What is scalar example?

973

How efficient is binary search?

872

Why are b trees used?

869

What are linked lists good for?

866

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

976

What is the most used data structure?

918

Which searching algorithm is best?

897

What is a tech stack?

876

How many types of data structure are there?

889

What are the Advantages and disadvantages of Array?

1159

What are the basic data structures?

995

Why set will not allow duplicates?

900