Comments by "" (@exiphykiller8438) on "Deque In Data Structure | Introduction To Deque With Example | Data Structures Tutorial |Simplilearn" video.

  1. As we need to add and remove elements from both the ends of Deque, Doubly Linked List will be the perfect strategy for implementation with O(1) complexity. So answer is Doubly LL and Circular Queue.
    4