Question

Identify the data structure which allows deletions at both ends of the list but insertion at only one end

Answer 1

it is input restricted deque...right!

Answer 2

Answer:

The queue has two ends, one used for insertion and the other for deletion.

Explanation:

Given: deletions at both ends of the list but insertion at only one end

To find: Identify the data structure

Step 1: A double-ended queue allows for insertion and deletion from both ends of the queue.

A queue is a collection of items that are kept in a sequence and may be updated by adding entities at one end of the sequence and removing entities from the other end of the sequence.

Step 2: In programming, a queue is a useful data structure. It is comparable to the line for tickets outside a movie theatre, where the person who joins the line first receives the first ticket. There are four distinct categories of lines: Basic Queue Looping queue.

Queue has two ends in which one end is used for the insertion and another end is used for the deletion.

Learn more about similar questions visit:

https://brainly.in/question/1732535?referrer=searchResults

https://brainly.in/question/12845716?referrer=searchResults

#SPJ2