Deque (Double-Ended Queue)
Insert and Delete from both ends. Visualized as a Circular Buffer.
0
1
2
3
4
Size: 0 / 5Status: Deque is empty.
Speed
Algorithm Logic
1function addRear(val):
2 if isFull(): return Overflow
3 if isEmpty(): front = rear = 0
4 else: rear = (rear + 1) % cap
5 deque[rear] = val
6 size++
Input
Capacity: 5