queue method in C++

* create
```
#include <queue>
using namespace std;

int main() {
    queue<int> a;  // default constructor
    queue<int> b(a);  // copy constructor
    queue<int> c(move(a));  // move constructor
    //queue<int> d{1,2,3};  // queue has no initializer list constructor
    //queue<int> e(3,1);  // queue has no fill constructor
    //queue<int> f(a.begin(),a.end());  // queue has no range constructor

    queue<int>* g = new queue<int>();  // new operator
    delete g;
}
```
* iterator (N/A)
* add
```
#include <iostream>
#include <queue>
using namespace std;

int main ()
{
    queue<int> q;

    q.push(1);
    q.emplace(3);
    
    while(!q.empty()) {
        cout<<q.front()<<",";
        q.pop();
    }
    cout<<endl;
}
// 1,3,
```
* change (N/A)
* query
```
#include <queue>
#include <iostream>
using namespace std;

int main() {
    queue<int> q;
    q.push(1);
    q.push(2);
    cout<<q.front()<<","<<q.back()<<endl;
    q.pop();
    cout<<q.empty()<<","<<q.size()<<endl;
}
```
* delete 
```
#include <queue>
#include <iostream>
using namespace std;

int main() {
    queue<int> q;
    q.push(1);
    q.pop();
    cout<<q.empty()<<","<<q.size()<<endl;
}
```
Home