binary search tree=(2^n)-n i.e (2^3)-3=5 binary tree=((2^n)-n)*n! i.e ((2^

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

Answer Posted / shalini

binary search tree=(2^n)-n i.e (2^3)-3=5
binary tree=((2^n)-n)*n! i.e ((2^3)-3)*3!=30

this is the right answer!!!!

Is This Answer Correct ?

2 Yes

4 No

Please Help Members By Posting Answers For Below Questions

Explain quick sort?

1011

What is binary search in data structure?

975

Describe the types of data structures?

1025

What is a data structure? What are the types of data structures? Briefly explain them

1016

How is the front of the queue calculated ?

1254

Is pointer a variable in data structure?

1381

Describe binary tree and its property.

967

Does hashset guarantee order?

1010

What is quick sort example?

921

Is learning data structures necessary?

930

What is the application of queue?

959

What do you mean by 2-3-4 tree?

1046

Why do we need algorithm?

926

What is stack explain with diagram?

955

Why is data structure?

920