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
- 71128 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 ? | 47 Yes | 21 No |
Post New Answer View All Answers
Which sorting algorithm has minimum number of swaps?
Define biconnectivity?
What is the height of binary tree?
What is an ordered list?
Which language is best for learning data structures and algorithms?
How to get a list of tables, views and columns in firebird database?
Can arraylist be resized?
How can we reverse the order in the treemap?
What is complexity of bubble sort?
What do you mean by structure property in a heap?
Define probing?
What are the types of map?
Is arraylist a collection?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
What is a treemap chart?
