stack
#include <stack>
stack<int> s;
s.push(a);
while(!s.empty)
{
cout<<s.top();
s.pop();
}
int size=s.size();
queue
#include <queue>
queue<string> Q;
Q.push(s);
while(!Q.empty())
{
cout<<Q.front();
Q.pop();
}
cout << "The first element is " << Q.front()
<< " and the last element is " << Q.back() << endl;
int size=Q.size();