{"id":9141,"date":"2022-07-20T10:38:00","date_gmt":"2022-07-20T10:38:00","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=9141"},"modified":"2022-12-14T10:49:30","modified_gmt":"2022-12-14T10:49:30","slug":"implement-stack-queue-using-deque","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/implement-stack-queue-using-deque\/","title":{"rendered":"Implement Stack Queue using Deque"},"content":{"rendered":"

\"\"<\/p>\n

What is Deque?<\/h3>\n

Deque is a double ended queue, i.e. a special kind of queue in which insertion and deletion can be done at the both rear as well as front end of the queue.You can implement both stack and queue by using deque.<\/p>\n

\"\"<\/p>\n

What is stack?<\/h3>\n

Stack follows the principle of LIFO (Last in First out) i.e. element which is inserted at last will be removed first. The operation for insertion of elements in stack is known as Push operation and the operation for deletion of element in stack is known as Pop operation.<\/p>\n

\"\"<\/p>\n

What is Queue?<\/h3>\n

Queue follows the principle of FIFO (First in First out) i.e. element which is inserted first will be removed first. The operation for insertion of elements is known as enqueue operation and the operation for deletion of elements is known as dequeue operation.<\/p>\n

\"\"<\/p>\n

Functions of deque that works same as the functions of stack and queue:<\/p>\n\n

Deque<\/strong><\/strong><\/th>Stack<\/strong><\/th>Queue<\/strong><\/strong><\/th><\/tr><\/thead>
size()<\/td>size()<\/td>size()<\/td><\/tr>
isEmpty()<\/td>isEmpty()<\/td>isEmpty()<\/td><\/tr>
Insert_First()<\/td>–<\/td>–<\/td><\/tr>
Insert_Last()<\/td>Push()<\/td>Enqueue()<\/td><\/tr>
Remove_First()<\/td>–<\/td>Dequeue()<\/td><\/tr>
Remove_Last()<\/td>Pop()<\/td>–<\/td><\/tr><\/tbody><\/table><\/figure>\n\n

Operations of Deque<\/h3>\n
    \n
  • size():<\/strong> This function returns the size of the deque.<\/li>\n
  • isEmpty():<\/strong> This function returns true if the deque is empty else false.<\/li>\n
  • Insert_First(element):<\/strong> This function will insert an element in the deque at the front end.<\/li>\n
  • Insert_Last(element):<\/strong> This function will insert an element in the deque at the rear end.<\/li>\n
  • Remove_First():<\/strong> This function will remove the element from the deque which is present at the front end.<\/li>\n
  • Remove_Last():<\/strong> This function will remove the element from the deque which is present at the rear end.<\/li>\n<\/ul>\n\t\t\t\t\t\t