STL Container Adaptors in C++

stack
#include <stack>
stack<int,vector<int> > mystack;
empty : Test whether container is empty
size : Return size
top : Access next element
push : Add element
pop : Remove element

queue
#include <queue>
queue<int,vector<int> > myqueue;
empty : Test whether container is empty
size : Return size
front : Access next element
back : Access last element
push : Insert element
pop : Delete next element

priority queue
#include <queue>
priority_queue<int, vector<int>, less<int> > myque;
empty :Test whether container is empty
size : Return size
top : Access top element
push : Insert element
pop : Remove top element