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
- 71301 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 binary search in programming?
What is the height of an empty tree?
Write code for reversing a linked list.
Write a code for dynamic allocation of array.
What type of data structure is used to perform recursion?
How do you use the sort function?
What is the height of binary tree?
State the rules to be followed during infix to prefix conversions?
What type of variable is age?
How does a dynamic array work?
How can I learn data structures?
Why do we use a multidimensional array in data structure?
What is circular linked list?
Is duplicate allowed in hashmap?
Why set will not allow duplicates?
