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

What is sequential mapping in data structure?

940

What is a circular singly linked list?

924

What is faster array or arraylist?

899

What is a data structure? What are the types of data structures?

1038

Why using cookie to store session info is a better idea than just using session info in the request?

932

What is precision in data structures?

1098

Explain the term base case?

911

What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks

2541

Why hashmap is faster than hashtable?

1018

Which is better hashmap or hashtable?

908

What exactly is data?

919

What are the 4 types of data?

1011

What are the topics in data structures?

1005

What is bitonic search?

945

Why do we use data structures?

894