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
- 78804 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / anonymous
30 binary trees 10 for each 1,2 and 3.
only 1 binary search tree as with 2 as root node 1 as right child and 3 as left child.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is a hash in programming?
State the merits of linear representation of binary trees?
List the area of applications where stack data structure can be used?
Is array part of collection framework?
What do you mean by data and data structure?
In what order the elements of a hashset are retrieved?
How to sequentially represent max-heap?
What is the top of a stack?
What does abstract data type mean?
What is bubble sort technique?
Which is faster treemap or hashmap?
Can arraylist store objects?
What is the difference between hashset and treeset?
How does arraylist size work?
Define primary data structures?
