A data structure in which elements can be inserted or deleted at/ from both the ends but

Question:

A data structure in which elements can be inserted or deleted at/ from both the ends but not in the middle is?

A. Queue

B. Circular queue

C. Dequeue

D. Priority queue

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: