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

Is null allowed in list?

857

What is ascii sort order?

908

What is difference between static and dynamic array?

944

What is the use of prototype?

909

What do you mean by general trees?

1014

Give a real time example of stack

948

Which sorting algorithm is worst?

895

How do you find the height of a binary tree?

891

Name two algorithms two find minimum spanning tree?

932

What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?

1033

Model a data structure for a DFA that takes an event as parameter and performs a desired action.

1105

What does quick sort do?

875

Does linkedhashset allow duplicates?

903

How would you implement two stacks using a single array?

990

What is precision in data structures?

1106