A ceret iku koleksi FIFO (First-In, First-Out): elemen ditambah ing mburi lan dibusak saka ngarep, kaya antrian wong.
Operasi
text
enqueue(1) enqueue(2) enqueue(3) dequeue()->1
front ->[1][2][3]<- back front ->[2][3]<- back
Conto
python
collections deque
queue = deque()
queue.append()
queue.append()
first = queue.popleft()
