These operations are called supportive queue operations. The image below shows how output restricted deque limits removal at one end.įour basic operations are performed on deque, they are as follows:Īlong with these primary operations, you can also perform isEmpty(), isFull() and Peek() operations. In the Output-Restricted Deque, it will perform the insertion at both ends, whereas it performs the deletion of elements at only one end. Output-Restricted Deque: It is a deque with some limitations while performing deletion operations.The image below shows how input restricted deque limits insertion at one end. In the Input-Restricted Deque, it will perform the deletion at both ends, whereas it performs the insertion at only one end. Input-Restricted Deque: It is a deque with some limitations while performing insertion operations.There are two types of deque which are created by restricting certain operations. This is how deque can use the FIFO principle to perform insertion and deletion. Doing this will allow deque to act as a linear queue.Īs shown in the image above, the element which enters at first will also leave the queue first. A Deque can perform insertion and deletion operations using the FIFO (First In First Out) principle.Īs deque can operate on both ends, you can extract queue properties by limiting insertion at the front node and removal at the rear node.This example demonstrates the LIFO principle. You inserted element 2 at last and removed it at first.

However, after repeating the removal of an element twice, data elements 2 and 12 get removed from the deque, respectively. Hence, it follows the Last In First Out Principle for insertion and deletion.Īs shown in the image above, initially, there were four elements inside this deque. When you do that, the deque becomes a stack. The insertion and deletion in deque can be limited to one node. A deque can perform both the insertion and deletion using the LIFO (Last In First Out) principle.Now, you will look into the primary properties of deque in a data structure.

Dequeue in data structure