(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

Write a program to reverse a link list.

898

What is an ordered list?

936

Why we need cursor implementation of linked lists?

951

Is pointer a variable in data structure?

1169

Do sets allow duplicates?

900

What is difference between hashmap and treemap?

905

Give one example of right rotation.

884

Write the recursive c function to count the number of nodes present in a binary tree.

837

What is the difference between data type and data structure?

827

What is the Insertion Sort Code?.

991

What type of memory allocation is referred for Linked lists?

1146

What does map stand for?

908

What is meant by heap sort?

829

Name some applications which use linked lists.

958

Which sort is stable?

903