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
77274 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 are the advantages and disadvantages of copyonwritearraylist?

1089

What are the advantages of data structure?

908

Is treeset thread safe?

863

Define Data Structures?

931

What is the easiest sorting method to use in data structures?

1035

Explain the priority queue?

926

What is a linear search?

976

Can arraylist contain duplicates?

818

What is ascii sort order?

869

Does treeset allow null values?

851

What is indexing an array?

990

What are the advantages of array?

866

What are the advantages and disadvantages of linked list?

823

Can a hashmap have duplicate keys?

894

What are the types of collision resolution strategies in open addressing?

972