Queue

enqueue()
dequeue()
front()
size()
empty()

C++

#include <queue>
using std::queue; // make queue 
queue<float> myQueue;

size(): Return the number of elements in the queue. empty(): Return true if the queue is empty and false otherwise.
push(e): Enqueue e at the rear of the queue.
pop(): Dequeue the element at the front of the queue.
front(): Return a reference to the element at the queue’s front. 
back(): Return a reference to the element at the queue’s rear.

#include <deque>
deque<int> dq;
deque<int> dq(10); 0를 10개 가지고는 것으로 시작
deque<int> dq(10,4); 4를 10개 가지고 있는 deque

dq[];
dq.front();
dq.back();
dq.clear();
dq.push_front();
dq.push_back();
dq.pop_front();
dq.pop_back();

나머지는 vector 유사

Python

from collections import deque