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
- 77013 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 algorithm is best for large data?
What are the properties of binary tree?
What is an acyclic graph?
What is a b+ tree? Explain its uses.
Run time memory allocation is known as in data structure?
Does set allow null values?
Can arraylist hold different types?
How will you reverse Linked List.
Which sorting technique is best?
Write the syntax in c to create a node in the singly linked list.
Define a stack?
What is the default size of arraylist?
Differentiate between arraylist and vector.
Can the double-checked locking fail on a single processor system?
Is hashmap a data structure?
