Which data structure allows deletions at both ends of a list but insertion only at one end?
A)Input-restricted deque
B)Output-restricted deque
C)Standard scores
D)Priority queues

Name: Which data structure allows deletions at both ends of a list but insertion only at one end? A)Input-restricted deque B)Output-restricted deque C)Standard scores D)Priority queues
Brand: Quizplus
Rating: 4.8 (44 reviews)

Question

Quizplus · Accepted Answer

An input-restricted deque allows insertion at only one end but allows deletion at both ends, fitting the description given.

Which Data Structure Allows Deletions at Both Ends of a List