for binary tree ans is 5, the general formula is (2^n)-n for binary search

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

Answer Posted / shweta

for binary tree ans is 5, the general formula is (2^n)-n
for binary search tree no. of tree possible is 3.
as root data can be either 1, 2 or 3

Is This Answer Correct ?

39 Yes

38 No

Please Help Members By Posting Answers For Below Questions

What is the difference between an array and vector?

1111

How do you reference all the elements in a one-dimension array?

1091

Mention the data structures which are used in graph implementation.

929

What is the difference between set and unordered_set?

912

Why is data structure important?

1064

Is array size dynamic or fixed?

1012

Can arraylist have duplicates?

977

How does bogo sort work?

1050

What is a pass in bubble sort?

964

How do I use quick sort?

914

Why is data structure used?

1035

What does arrays tostring do?

944

State the difference between primitive and non-primitive data types?

1216

In rdbms, explain what is the efficient data structure used in the internal storage representation?

999

What is an expression tree?

1070