no.of binary trees=n!*(2^(n)-n) no.of bst's=n*[2^(n)-n] if 1,2,3 a

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

Answer Posted / gurwinder

no.of binary trees=n!*(2^(n)-n)
no.of bst's=n*[2^(n)-n]

if 1,2,3 are key nodes
then:
no. of BST=15
no. of binary trees= 30

Is This Answer Correct ?

2 Yes

4 No

Please Help Members By Posting Answers For Below Questions

Is hashset a collection?

860

What does map stand for?

892

What is a multiset table?

813

State the advantages of using postfix notations?

1008

What is dequeue in data structure?

860

Explain the expression trees?

940

What are arrays give example?

854

Does arraylist guarantee insertion order?

862

Explain the term binding time?

878

Which is faster treemap or hashmap?

829

Can sets contain duplicates?

781

What is linked hash set?

781

What is meant by ordered and sorted in collections?

846

What do you mean by data and data structure?

919

Which sorting is best for large data?

869