A double ended queue (dequeue) is a linear list for which insertions and deletions can occur at either end. Show how to represent a dequeue in a one-dimensional array and write algorithms that insert and delete at either end.

Answer rating: 100% (QA)

For implementing deque we need to keep track of two indices front and rear We enqueuepush an item at the rear or the front end of qedue and dequeuepop an item from both rear and front end Working 1 Cr... View the full answer