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
- 77185 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
How do you assign an address to an element of a pointer array ?
What is 2 dimensional linked list?
How do you do a selection sort?
Is array a data structure?
Can you please explain the difference between string and an array?
What are the basic operations of stack?
How do you find the height of a binary tree?
What is queue in data structure?
Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?
What is a hashers run?
What is static array?
Define splay tree?
Write the syntax in c to create a node in the singly linked list.
What is the advantage of the heap over a stack?
Discuss the difference between a stack and an Array?
