Data Structures and Algorithms - Old Questions
3. Write binary search. Consider a hash table of size 10; insert the keys 62, 37, 36, 44, 67, 91 and 107 using linear probing. [2+3]
5 marks
|
Asked in 2019