(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 actions are performed when a function is called?

921

Does treemap sort on key or value?

825

Can arraylist store objects?

869

What is meant by balanced binary tree?

828

Can a stack be described as a pointer? Explain.

853

Explain the Array

935

Mention one advantage and disadvantage of using quadratic probing?

955

What is the difference between a hashmap and hashtable?

773

What does isempty() member method determines?

873

How to find the duplicate in an array?

905

Are linked lists considered linear or non-linear data structure?

964

What is a hash in programming?

856

Different Types of pattern?

912

What is difference between list and linked list?

903

What is hash data type?

890