Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 77425 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / gautham
The Catalan Numbers should give an answer.. The answer is
C(3)= 5.
| Is This Answer Correct ? | 48 Yes | 21 No |
Post New Answer View All Answers
Which sorting is best and why?
What is complete binary tree in data structure?
What is an acyclic graph?
Describe full binary tree and complete binary tree.
Differentiate stack from array?
Mention a few applications of linked lists?
Can we override compareto method for enumerations?
Why hashmap is faster than hashset?
Tell me the difference between structure and array?
Is merge sort better than quick?
Describe the level term in a tree.
Explain stacks and queues in detail.
What is difference between list and array list?
What is thread and types of thread?
When should structures be passed by values or by reference?
