To identify the correct data structure that allows elements to be inserted or deleted at both ends but not in the middle, let's analyze the options provided:

1. **A. Queue**: This generally allows insertion at the end and deletion from the front, but not at both ends. Thus, it does not meet the criteria.

2. **B. Circular queue**: This is an improved version of a linear queue that allows for continuous usage of array space. However, like a standard queue, it still does not allow operations at both ends.

3. **C. Dequeue (Double-ended queue)**: This structure allows insertion and deletion of elements from both the front and the back. Therefore, it fits the criteria perfectly.

4. **D. Priority queue**: This structure stores elements based on their priority, allowing for insertion and deletion based on priority rather than the ends. Hence, it doesn't meet the requirement.

### Final Answer
The correct answer is **C. Dequeue**.

Question

To identify the correct data structure that allows elements to be inserted or deleted at both ends but not in the middle, let's analyze the options provided:

1. **A. Queue**: This generally allows insertion at the end and deletion from the front, but not at both ends. Thus, it does not meet the criteria.

2. **B. Circular queue**: This is an improved version of a linear queue that allows for continuous usage of array space. However, like a standard queue, it still does not allow operations at both ends.

3. **C. Dequeue (Double-ended queue)**: This structure allows insertion and deletion of elements from both the front and the back. Therefore, it fits the criteria perfectly.

4. **D. Priority queue**: This structure stores elements based on their priority, allowing for insertion and deletion based on priority rather than the ends. Hence, it doesn't meet the requirement.

### Final Answer
The correct answer is **C. Dequeue**.

Knowee AI · Accepted Answer

To identify the correct data structure that allows elements to be inserted or deleted at both ends but not in the middle, let's analyze the options provided:

1. **A. Queue**: This generally allows insertion at the end and deletion from the front, but not at both ends. Thus, it does not meet the criteria.

2. **B. Circular queue**: This is an improved version of a linear queue that allows for continuous usage of array space. However, like a standard queue, it still does not allow operations at both ends.

3. **C. Dequeue (Double-ended queue)**: This structure allows insertion and deletion of elements from both the front and the back. Therefore, it fits the criteria perfectly.

4. **D. Priority queue**: This structure stores elements based on their priority, allowing for insertion and deletion based on priority rather than the ends. Hence, it doesn't meet the requirement.

### Final Answer
The correct answer is **C. Dequeue**.

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle:AQueueBCircular queueCDequeueDPriority queue

Question

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

Solution

Final Answer

Similar Questions

Upgrade your grade with Knowee