Question

When designing a system where data records are frequently added and removed from the middle of a sequence, which data structure offers the most efficient operations for these specific tasks?

A Array
B Hash Table
C Linked List
D Binary Search Tree
E Stack
Practice Next

Hey! Ask a query