A linear data structure in which insertion and deletion operations can be performed from both the ends is
Show answerHide answer
Correct answer: (C) deque
Explanation
A deque (double-ended queue) allows insertion and deletion at both the front and the rear.