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
- 71406 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / kanha
for binary tree answer is n! ways that is 3!=6
For Binary search tree n ways..that is 3
| Is This Answer Correct ? | 17 Yes | 52 No |
Post New Answer View All Answers
Which type of sorting is best?
How can you add an item to the beginning of the list?
How can I study data structures and algorithms?
What’s the difference between enumeration and iterator interfaces?
What is an externalizable interface?
What is the use of space complexity and time complexity?
Can a stack be described as a pointer? Explain.
What is the difference between hashmap and arraylist?
List the data structures which are used in rdbms.
What do you know about traversal in linked lists?
Who invented quicksort?
What is a undirected graph?
What is a Stack? Explain with example?
What is the best complexity of bubble sort?
How does shell sort work?
