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
77916 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 happens when arraylist is full?

982

What is a linear search?

1012

What is a pass in bubble sort?

888

How do signed and unsigned numbers affect memory?

880

Have you ever used HashTable and Directory?

976

What are the disadvantages array implementations of linked list?

927

What does arraylist remove do?

997

Write a Program for Insert in a sorted list

916

What is an externalizable interface?

965

Is heap sort faster than quicksort?

819

Explain Array of pointers?

964

State the demerits of linked representation of binary trees?

922

What is heap tree in data structure?

917

Describe linear probing with an example.

978

What are the five examples of data?

961