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 null a binary search tree?

850

List out the applications of a linked list?

886

What is the default value of Array?

1130

Write the algorithm for converting infix expression to postfix expression?

971

What are trees in data structures?

932

What is a pseudocode example?

978

Which process places data at the back of the queue?

1146

What is subtree?

909

What is ascending and descending order?

838

What is difference between concurrenthashmap and hashtable?

924

What is data type explain?

1106

Can I provide array size dynamically?

944

List the limitations of linear probing?

933

Can you sort a string?

796

Explain the implementation of an AVL tree and Binary tree.

952