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
- 78833 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / swapna
18 Binary trees and 3 Binary serach trees.
| Is This Answer Correct ? | 35 Yes | 99 No |
Post New Answer View All Answers
What does arrays tostring do?
How to show internal storage representation of data structure in RDBM?
Is hashmap a collection?
How will you check the validity of an expression containing nested parentheses?
What is data and data types?
What is fibonacci search?
How does bogo sort work?
Differentiate between an array and an arraylist.
What are the advantages of merge sort?
What do you mean by sorting data?
Is hashmap part of collection?
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 is array indexing?
What is comparable interface?
What is meant by a dynamic array?
