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
- 78841 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / shekhar
(2n C n) / (n+1) is the Number of BST if N is the number of
integer/value;
| Is This Answer Correct ? | 17 Yes | 8 No |
Post New Answer View All Answers
Can we add duplicate keys in a hashmap? What will happen if we attempt to add duplicate values?
How do you sort an array in descending order?
Describe binary tree and its property.
Name few classes that implement collection interface?
What is the space complexity of selection sort?
Define ancestor and descendant ?
How do you find the size of an arraylist?
What is difference between hashset and linkedhashset?
How do you empty an arraylist?
Sorting is not possible by using which of the methods?
What is the height of an empty tree?
List the differences between comparable and comparator interface?
Which is the slowest sorting algorithm?
What does simulation of queues mean?
What is a matrix? Explain its uses with an example
