queue in C++

Queues are designed to operate in a First-In-First-Out context (FIFO), where elements are inserted into one end of the container and extracted from the other.
```
#include <iostream>
#include <queue>
using namespace std;

int main() {
    queue<int> q;
    q.push(1);
    q.push(2);
    while(!q.empty()) {
        cout << q.front() << endl;
        q.pop();
    }
    return 0;
}
```