Computer Science · Data Structures
A double-ended queue (deque) supports adding and removing items from both ends. The operations are AddFront(), AddRear(), RemoveFront(), and RemoveRear(). If you are given only stacks (supporting only push and pop) to implement this data structure, what is the best possible time complexity of performing AddFront() and AddRear() respectively, assuming m is the stack capacity and n is the current number of elements?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n) and O(m)
- 2O(n) and O(1)
- 3O(1) and O(n)✓
- 4O(m) and O(n)
Correct answer
O(1) and O(n)
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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures