Question

If one wants to add and delete elements quickly without reshuffling the rest, then which data structure suits the best?

• A. Linked list
• B. Tree
• C. B-Tree
• D. Array

Hint:

For quick addition or deletion of elements, linked lists are preferred due to their dynamic nature.

Answer 1

The Correct Option is A

A linked list allows efficient insertion and deletion of elements without requiring any reshuffling of the other elements. In contrast, data structures like arrays require shifting of elements when an element is added or removed.