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

What are trees in data structures?

968

Is quicksort a stable sorting algorithm?

1051

What is dynamic array with example?

1031

What is modcount in hashmap?

935

Why do we use collections?

931

How many types of priority queue are there?

966

Write an algorithm that counts number of nodes in the circular linked list

957

How do you sort in ascending order in arraylist?

921

Does concurrenthashmap allow null?

997

In what areas do data structures applied?

992

Write a Program for Linked list manipulation.

1085

What is top in stack?

903

Which are the sorted collections?

998

Why is an array homogeneous?

916

What are the categories of avl rotations?

1044