for binary search tree, no of trees, (2^n)-n... here 8-3=5 trees... u can

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

28 Answers
77028 Views
Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
E-Mail Answers

Answer Posted / poornakala

for binary search tree, no of trees, (2^n)-n... here 8-3=5
trees... u can draw n see...

for binary tree, no of trees n(2^n)-n here 3*5=15...
replace node in each bst with other two values and see....

Is This Answer Correct ?

72 Yes

48 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

What is queue in data structure?

904

What is heap tree explain with example?

904

Is null allowed in list?

811

Explain Linked List

938

What is the difference between adt and data structure?

908

Who invented merge sort?

822

Explain what are the methods available in storing sequential files ?

863

What is thread and types of thread?

893

What is binary search tree and explain its time complexity?

881

Define avl tree?

1094

Name some applications which use linked lists.

940

Model a data structure for a DFA that takes an event as parameter and performs a desired action.

1050

What do you mean by probing?

898

What is sequential search? What is the average number of comparisons in a sequential search?

766

What are dynamic data structures?

1241