Computer Science · Data Structures and Algorithms
Which of the following data structures allows insertion and deletion operations at both ends, and can be implemented using only increment/decrement pointer operations?
- 1Deques✓
- 2Priority Queues
- 3Stacks
- 4Queues
Correct answer
Deques
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms