MCQOPTIONS
Saved Bookmarks
| 1. |
Suppose you want to delete the name that occurs beforeVivekin an alphabetical listing. Which of the following data structures shall be most efficient for this operation? |
| A. | Circular linked list |
| B. | Doubly linked list |
| C. | Linked list |
| D. | Dequeue |
| Answer» C. Linked list | |