How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?
Answer Posted / hash define
12 binary trees
3 binary search trees
| Is This Answer Correct ? | 10 Yes | 44 No |
Post New Answer View All Answers
What is sorted list in data structure?
How do you explain bubble sort?
What is a vector element?
What is the use of placement new?
What do you mean by the term “percolate down”?
Are linked lists useful?
Differentiate between set and map.
Is vector synchronized?
What is difference between hashtable and hashmap?
How would you use bsearch() function to search a name stored in array of pointers to string?
Define root?
Explain the difference between hashset and hashmap?
What is an iterative algorithm?
What type of memory allocation is referred for Linked lists?
How would you use qsort() function to sort the name stored in an array of pointers to string?