Example_code_V5

#include <iostream>
#include <vector>
using namespace std;
#include <stack>
#include <queue>

// what tf do stacks do? they are like a vector but they only allow you to add and remove from the top of the stack
// we use it for first in last out (FILO) operations. The last item added to the stack is the first one to be removed.
// ex: undo button

// what tf do queues do? they are like a vector but they only allow you to add to the back and remove from the front of the queue
// basicaly a stack but reverse using fist in first out (FIFO) operations. The first item added to the queue is the first one to be removed.

int main()
{
    stack<int> s;
    s.push(1);
    s.push(2);
    s.push(3);
    cout << "top of stack: " << s.top() << endl;
    s.pop(); // removes the top item from the stack
    cout << "top of stack after pop: " << s.top() << endl;

    queue<int> q;
    q.push(1);
    cout << "front of queue: " << q.front() << endl;
    q.pop();
    cout << "front of queue after pop: " << q.front() << endl;

    return 0;
}