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
- 78129 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
Define the graph data structure?
What is the default size of an arraylist?
Which file contains the definition of member functions?
What's the difference between a hashtable and a hashmap?
How to search binary in a sorted array?
How do you find the complexity of a selection sort?
Why do we use data structures?
Is hashmap sorted?
What is priority queue in data structure?
What do you mean by external sorting?
Explain what is the type of the algorithm used in solving the 8 queens problem?
What data type is array?
Is arraylist reference type?
What is hashing technique? Describe in brief.
What is minimum depth of binary tree?
