Which of the following data structures allows both addition and deletion of…
2017
Which of the following data structures allows both addition and deletion of items from either end?
Answer: A. Double Ended Queue — The correct option is A. A Double Ended Queue (commonly known as a Deque) is a generalized linear data structure that permits insertions and deletions from…
- A.
Double Ended Queue
- B.
Queue
- C.
Priority Queue
- D.
Stack
Attempted by 1086 students.
Show answer & explanation
Correct answer: A
The correct option is A. A Double Ended Queue (commonly known as a Deque) is a generalized linear data structure that permits insertions and deletions from both the front and the rear ends, unlike a standard queue which follows strict FIFO rules.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…