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
- 77012 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / babugct
All the above answers are wrong............
please post some correct answer...
as far as my concern,,,
no.of binary trees=n!*(2^(n)-n)
no.of bst's=2^(n)-n...
pls inform if wrong
| Is This Answer Correct ? | 7 Yes | 6 No |
Post New Answer View All Answers
Define the tree data structure.
What is immutablelist?
which is the simplest file structure? (Sequential, indexed, random)
How to initialize Dictionary using collection initialize?
What can be stored in an arraylist?
What is push and pop in stack?
Differentiate between iterator and enumeration.
What are the collision resolution methods?
What is stack in geography?
For addition and deletion. Which one is most preferred: array list or linked list?
What does adt stands for?
What is bubble sort and quick sort?
Why is tuple immutable?
What is map keyset?
Explain Linked List
