A mtazamo ni muunganisho wa FIFO (First-In, First-Out): elementi huongezwa kwenye mwisho na kuondolewa kutoka kwenye mbele, kama foleni ya watu.
Operesheni
text
enqueue(1) enqueue(2) enqueue(3) dequeue()->1
front ->[1][2][3]<- back front ->[2][3]<- back
Mfano
python
collections deque
queue = deque()
queue.append()
queue.append()
first = queue.popleft()
