Deque Operations

COSC 2306 - Double-Ended Queue (Stack vs Queue Implementation)

Select Behavior Mode

Visual Workspace

Size: 0

Left End (popleft)

Right End (append)

Deque is currently empty

Controls

Queue Logic

In a Queue, items are added to the right using append() and removed from the left using popleft(). First-In, First-Out (FIFO).

# Initialize deque visualizer...
> from collections import deque
> my_deque = deque()

Python Deque Implementations

Queue implementation using deque

from collections import deque

queue = deque()
print(queue)

# enqueue element to a queue
queue.append('a')
queue.append('b')
queue.append('c')

# remove elements in FIFO order
print(queue.popleft()) # a
print(queue.popleft()) # b
print(queue.popleft()) # c

Stack implementation using deque

from collections import deque

stack = deque()
print(stack)

# push element in the stack
stack.append('a')
stack.append('b')
stack.append('c')

# pop element in LIFO order
print(stack.pop()) # c
print(stack.pop()) # b
print(stack.pop()) # a