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

How do you find the time complexity of a bubble sort?

840

How to do the intersection of two sorted arrays?

1028

Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked)

972

What is list and its types?

889

How do you implement a stack?

893

Which sorting algorithm is used in arrays sort?

884

What is difference between concurrenthashmap and hashtable?

917

Can you sort a hashset?

910

What is basic data structure?

896

Explain heapsort. What is its complexity?

968

List out the advantages of using a linked list?

850

Why is sorting necessary?

869

Describe what is Node in link list? And name the types of Linked Lists?

922

What do you mean by quadratic probing?

946

What is binary search in programming?

899