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
- 71224 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / baljinder
1oth answer is xactly correst ie,BST=5 & BT=30
| Is This Answer Correct ? | 5 Yes | 1 No |
Post New Answer View All Answers
What is an array vs list?
Can you distinguish between ArrayList and Array?
Why is quicksort not stable?
Which is better hashset or treeset?
Does linkedhashset allow null values?
Is a hash table a map?
Which is faster hashmap or hashset?
Write a program for Sorting an Array. Which sorting will you prefer?
Can we modify final arraylist?
What are the types of array operations?
What is difference between hashmap and map?
What is time complexity of binary search?
What are data and data types?
Explain set interface?
What is the complexity of adding an element to the heap?
