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
- 77945 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
Does concat mutate array?
Explain the term binding time?
What do you mean by complexity of search algorithm?
What are the major data structures used in the rdbms?
Why use a tuple instead of a list?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.
What is the difference between length () and size () of arraylist?
How does variable declaration affect memory allocation?
How would you sort words in a large file?
How null key is handled in hashmap?
What is array define its types?
What is numeric array?
How can you correct these errors?
What do you mean by sorting data?
Can treeset contain duplicates?
