InterviewSolution
Saved Bookmarks
| 1. |
Which data structure would be the most appropriate to implement a collection of values with the following three characteristics?i) Items are retrieved and removed from the collection in FIFO order.ii) There is no priori limit to the number of items in the collection.iii) The size of an item is large relative to storage required for a memory address.(A) Singly linked list with head and tail pointers(B) Doubly linked list with only a head pointer(C) Binary tree(D) Hash table |
| Answer» | |