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
78201 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 the meaning of anonymous array? Explain with an example?

1204

Differentiate between push and pop?

1272

What is the difference between array and list?

923

What is best time complexity?

854

What is homogeneous array?

873

Which searching algorithm is best?

898

Does treemap preserve order?

853

What is the difference between data type and data structure?

874

Which sorting is best?

912

What do you mean by back edge?

1073

What is binary tree and its types?

992

What is hash value of a string?

906

What are linked lists good for?

870

What type of algorithm is binary search?

845

What are linked list?

959