Question:

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

Show Hint

For quick addition or deletion of elements, linked lists are preferred due to their dynamic nature.
Updated On: Jun 16, 2025
  • Linked list
  • Tree
  • B-Tree
  • Array
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

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.
Was this answer helpful?
0
0