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
- 78831 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / mann
binary seach tree will be one withh 2as root node
and 1 as left child and 3 as right child of root(2).
| Is This Answer Correct ? | 0 Yes | 1 No |
Post New Answer View All Answers
Is copyonwritearraylist thread safe?
What are the pre-requisite for the collection to perform binary search?
Can hashmap have duplicate keys?
What is adt example?
Tell me about circular linked list?
Can you sort a string?
Do you know how to find if linked list has loop?
What is sort order?
State the demerits of linked representation of binary trees?
Is treemap synchronized?
Will it create any problem if we add elements with key as user defined object into the treemap?
What is subtree?
What is the use of data structure?
Why entry interface is used in map?
Is array faster than arraylist?
