How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?
- 28 Answers
- 71261 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / babugct
All the above answers are wrong............
please post some correct answer...
as far as my concern,,,
no.of binary trees=n!*(2^(n)-n)
no.of bst's=2^(n)-n...
pls inform if wrong
| Is This Answer Correct ? | 7 Yes | 6 No |
Post New Answer View All Answers
What is the Insertion Sort Code?.
What are the disadvantages of circular list?
Define depth and height of a tree?
What is faster array or arraylist?
Does stringutils isempty check for null?
Is bubble sort slow?
Why is data structure?
Explain about circular linked list?
What is shell sort in data structure?
Which is faster hashmap or treemap?
Explain linked list in short.
Which interfaces are implemented by concurrentskiplistset?
Are hash tables ordered?
What is list and types of list?
What are the classification of data structures?
