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
78091 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

Write the algorithm for converting infix expression to postfix expression?

964

What is a comparator function?

935

What is the family trees and connection by clause?

889

Is it legal to initialize list like this?

969

What are the basic operations of stack?

904

Explain binary searching, Fibonacci search.

946

How many types of linked list exist?

966

Does treeset allow duplicates?

893

How can I learn data structures?

934

How do you access the values within an array?

1063

What is a data structure node class?

1022

Describe the complexity of Quick Sort

933

Is array of data structure?

839

Differentiate between arraylist and linkedlist.

1114

How do you get placements?

848