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
- 77932 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 is heap tree in data structure?
How many passes are required in bubble sort?
What is shell sort in data structure?
What is an iterative algorithm?
Can arraylist have null values?
How does dynamic memory allocation help in managing data?
What should I learn first data structures or algorithms?
Why is data structure used?
What is a stable algorithm?
State the advantages of using postfix notations?
Difference between calloc and malloc ?
What is scalar data type?
What is inplace sorting?
What is a simple path?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
