(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 are lists?

936

State the merit of linked representation of binary trees?

927

Differentiate null and void?

857

Name few classes that implement collection interface?

914

What is tree and its properties?

884

Why is sorting necessary?

869

What are the different types of data structures explain briefly?

1059

What is the difference between linked list and array?

971

What are the advantages of array?

903

What is the height of an empty tree?

949

How do you find the number of comparisons in bubble sort?

878

What is a linear search?

1014

Mention one advantage and disadvantage of using quadratic probing?

1007

What is data and information explain with example?

956

What happens if an array goes out-of-bounds?

1081