A linear data structure in which insertion and deletion operations can be…
A linear data structure in which insertion and deletion operations can be performed from both the ends is___
Answer: B. Deque — Answer: b Explanation: The answer is b, i.e., Deque. The deque is a data structure in which both insertion and deletion can be performed from both the ends…
- A.
Queue
- B.
Deque
- C.
Priority queue
- D.
Circular queue
Attempted by 516 students.
Show answer & explanation
Correct answer: B
Answer: b
Explanation: The answer is b, i.e., Deque. The deque is a data structure in which both insertion and deletion can be performed from both the ends whereas, in Queue, insertion can be done from one end and deletion can be performed from another end.
Loading lesson…