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
- 78105 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
Does array sort mutate?
Does treeset remove duplicates?
What is linear-logarithm chasm?
Write an algorithm that counts number of nodes in the circular linked list
What do you mean by structure property in a heap?
What is the complexity of adding an element to the heap?
What is difference between an Array and ArrayList?
What thread means?
Is arraylist a collection?
Which is faster array or linked list?
Differentiate among cycle, path, and circuit?
If we try to add duplicate key to the hashmap, what will happen?
What is a spanning tree?does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Define graph?
What is heap and its types?
