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

Differentiate between the singly linked list and doubly linked list.

988

Define union-by-weight?

1036

Which is the parent class of abstractsequentiallist class?

956

Is array a data type?

864

What is treemap chart?

870

What is the best case complexity of bubble sort?

851

Can you override methods of arraylist?

995

How many sorting algorithms are there?

1004

Why is map not a collection?

866

What is default array size?

1014

What is data structures in computer science?

927

Which sort algorithm is best?

936

How do you sort an array in decreasing order?

855

What is difference between list and linked list?

960

Write a recursive c function to calculate the height of a binary tree.

910