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
- 78104 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
What are the pre-requisite for the collection to perform binary search?
Write the c program to insert a node in circular singly list at the beginning.
What is the use of isEmpty() member methods?
Define linear probing?
Tell me how to find middle element of linked list in one pass?
What are the tasks performed during postorder traversal?
What is the advantage of the heap over a stack?
Is array a data structure?
Which is the fastest sorting?
What happens if we put duplicate key in hashmap?
How helpful is abstract data type of data structures?
Tell us the difference between merge and quick sort. Which one would you prefer and why?
Write an algorithm that counts number of nodes in the circular linked list
What is reduction to sorting method?
Differentiate bfs and dfs?
