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
- 78818 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
Explain Stack
Differentiate between iterator and enumeration.
Explain the priority queue?
Can we apply binary search algorithm to a sorted linked list, why?
What is time complexity of binary search?
How to initialize Dictionary using collection initialize?
What is a subtree in data structures?
State the difference between arrays and linked lists?
What is an acyclic graph?
Why is hashmap faster than arraylist?
Is hashtable better than dictionary?
Define non-terminal nodes in a tree?
What is the capacity of arraylist?
How many types of linked list exist?
What is storage structure in data structure?
