Stacks and queues.

See version :

Pas de dépendances

Download :

#include <iostream>
#include <stack>
#include <queue>

using namespace std;

int main()
{
    stack<int> s;
    queue<int> q;
    
    s.push(5);
    s.push(13);
    s.push(8);
    s.push(6);

    q.push(5);
    q.push(13);
    q.push(8);
    q.push(6);

    cout << "lecture de la pile" << endl;
    while(!s.empty())
    {
        cout << s.top() << endl;
        s.pop();
    }

    cout << "lecture de la file" << endl;
    while(!q.empty())
    {
        cout << q.front() << endl;
        q.pop();
    }
    return 0;
}

	No explanations yet.