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

Differentiate bfs and dfs?

1014

How does arraylist size work?

900

Explain what are the methods available in storing sequential files ?

939

What is comparator interface used for?

1078

What are the average and worst time complexity in a sorted binary tree is

971

Which one is the simplest sorting in data structure?

1064

What sort of serious problems have you experienced, and how have you handled them?

955

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

941

What is time complexity of hashmap?

1096

Differentiate between failfast and failsafe.

1178

How many types of data structures are used?

988

what are the applications of Linked Lists?

1019

What is unbounded queue?

925

Can a stack be described as a pointer? Explain.

930

Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.

896