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
- 78172 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / vipul
number of binary search tree= (2n)!/{n!*(n+1)!}
and number of binary tree=(2n)!/(n+1)!
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
How many types of data structures are used?
Is selection sort greedy?
Mention a few applications of linked lists?
What happens if we put a key object in a hashmap which exists?
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
What is worst case complexity algorithm?
Differentiate null and void?
What is the similarity between a Structure, Union and enumeration?
Is arraylist heterogeneous?
What is difference between stack and queue?
What is best time complexity?
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
What's the difference between a hashtable and a hashmap?
Is hashmap keyset ordered?
Which is the parent class of deque
