Deque (Doubly Ended Queue) in Python is implemented using the module “collections“. Deque is preferred over list in the cases where we need quicker append and pop operations from both the ends of container, as deque provides an O(1) time complexity for append and pop operations as compared to list which provides O(n) time complexity.
Example:
Python3
# Python code to demonstrate deque from collections import deque # Declaring deque queue = deque(['name','age','DOB']) print(queue) |
Output:
deque(['name', 'age', 'DOB'])
Let’s see various Operations on deque :
- append() :- This function is used to insert the value in its argument to the right end of deque.
- appendleft() :- This function is used to insert the value in its argument to the left end of deque.
- pop() :- This function is used to delete an argument from the right end of deque.
- popleft() :- This function is used to delete an argument from the left end of deque.
Python3
# Python code to demonstrate working of # append(), appendleft(), pop(), and popleft()# importing "collections" for deque operationsimport collections# initializing dequede = collections.deque([1,2,3])# using append() to insert element at right end # inserts 4 at the end of dequede.append(4)# printing modified dequeprint ("The deque after appending at right is : ")print (de)# using appendleft() to insert element at left end # inserts 6 at the beginning of dequede.appendleft(6)# printing modified dequeprint ("The deque after appending at left is : ")print (de)# using pop() to delete element from right end # deletes 4 from the right end of dequede.pop()# printing modified dequeprint ("The deque after deleting from right is : ")print (de)# using popleft() to delete element from left end # deletes 6 from the left end of dequede.popleft()# printing modified dequeprint ("The deque after deleting from left is : ")print (de) |
Output:
The deque after appending at right is : deque([1, 2, 3, 4]) The deque after appending at left is : deque([6, 1, 2, 3, 4]) The deque after deleting from right is : deque([6, 1, 2, 3]) The deque after deleting from left is : deque([1, 2, 3])
- index(ele, beg, end) :- This function returns the first index of the value mentioned in arguments, starting searching from beg till end index.
- insert(i, a) :- This function inserts the value mentioned in arguments(a) at index(i) specified in arguments.
- remove() :- This function removes the first occurrence of value mentioned in arguments.
- count() :- This function counts the number of occurrences of value mentioned in arguments.
Python3
# Python code to demonstrate working of # insert(), index(), remove(), count()# importing "collections" for deque operationsimport collections# initializing dequede = collections.deque([1, 2, 3, 3, 4, 2, 4])# using index() to print the first occurrence of 4print ("The number 4 first occurs at a position : ")print (de.index(4,2,5))# using insert() to insert the value 3 at 5th positionde.insert(4,3)# printing modified dequeprint ("The deque after inserting 3 at 5th position is : ")print (de)# using count() to count the occurrences of 3print ("The count of 3 in deque is : ")print (de.count(3))# using remove() to remove the first occurrence of 3de.remove(3)# printing modified dequeprint ("The deque after deleting first occurrence of 3 is : ")print (de) |
Output:
The number 4 first occurs at a position : 4 The deque after inserting 3 at 5th position is : deque([1, 2, 3, 3, 3, 4, 2, 4]) The count of 3 in deque is : 3 The deque after deleting first occurrence of 3 is : deque([1, 2, 3, 3, 4, 2, 4])
- extend(iterable) :- This function is used to add multiple values at the right end of deque. The argument passed is an iterable.
- extendleft(iterable) :- This function is used to add multiple values at the left end of deque. The argument passed is an iterable. Order is reversed as a result of left appends.
- reverse() :- This function is used to reverse order of deque elements.
- rotate() :- This function rotates the deque by the number specified in arguments. If the number specified is negative, rotation occurs to left. Else rotation is to right.
Python3
# Python code to demonstrate working of # extend(), extendleft(), rotate(), reverse()# importing "collections" for deque operationsimport collections# initializing dequede = collections.deque([1, 2, 3,])# using extend() to add numbers to right end # adds 4,5,6 to right endde.extend([4,5,6])# printing modified dequeprint ("The deque after extending deque at end is : ")print (de)# using extendleft() to add numbers to left end # adds 7,8,9 to right endde.extendleft([7,8,9])# printing modified dequeprint ("The deque after extending deque at beginning is : ")print (de)# using rotate() to rotate the deque# rotates by 3 to leftde.rotate(-3)# printing modified dequeprint ("The deque after rotating deque is : ")print (de)# using reverse() to reverse the dequede.reverse()# printing modified dequeprint ("The deque after reversing deque is : ")print (de) |
Output :
The deque after extending deque at end is : deque([1, 2, 3, 4, 5, 6]) The deque after extending deque at beginning is : deque([9, 8, 7, 1, 2, 3, 4, 5, 6]) The deque after rotating deque is : deque([1, 2, 3, 4, 5, 6, 9, 8, 7]) The deque after reversing deque is : deque([7, 8, 9, 6, 5, 4, 3, 2, 1])
This article is contributed by Manjeet Singh. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention geek! Strengthen your foundations with the Python Programming Foundation Course and learn the basics.
To begin with, your interview preparations Enhance your Data Structures concepts with the Python DS Course.

