binary tree = n!(2^n - n). for n =3 its 30. for BST its 2n

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

Answer Posted / rohit

binary tree = n!(2^n - n).
for n =3 its 30.

for BST its 2n
C * [1/(n+1)]
n
for n=3 its 5.

Is This Answer Correct ?

1 Yes

1 No

Please Help Members By Posting Answers For Below Questions

What is the difference between one and two dimensional?

944

What is non linear data structure with example?

879

Differentiate between iterable and iterator.

1028

Does list maintain insertion order?

828

What do you know about traversal in linked lists?

856

what are the applications of Linked Lists?

949

What do you mean by Syntax Error

999

What is difference between array and arraylist? When will you use array over arraylist?

916

Is treemap synchronized?

863

Can we put null key in hashmap?

844

What is time and space complexity of bubble sort?

758

What is frozenset?

839

What are hashmaps good for?

846

Define primary clustering?

881

What are the difference between malloc() and calloc()?

938