A data structure where elements can be added or removed at either end but not in the middle is called _____.

– by

A. linked lists

B. stacks

C. queues

D. dequeue

Submitted By : Ahsan Ali Soomro