colas con listas

// colas con listas

#include <iostream>

using namespace std;

struct node {
    int entry = 0;
    node* next = nullptr;
};

struct queue {
    node* front = nullptr;
    node* rear = nullptr;
};

bool is_empty (const queue& q)
{
    return q.front == nullptr;
}

void enqueue (queue& q, int v)
{
    node* nuevo = new node;
    nuevo->entry = v;

    if(q.rear != 0) // apunta a algo?
        q.rear->next = nuevo;

    q.rear = nuevo;

    if (q.front == 0)
        q.front = nuevo;
}

void dequeue (queue& q, int& v)
{
    v = q.front->entry;
    node* aux = q.front;
    q.front = q.front->next;
    if (q.front == 0)
        q.rear = 0;
    delete aux;
}

int main()
{
    queue q; int a;

    for (int i = 0; i<10; i++)
        enqueue(q, i+1);

    enqueue(q, 5);

    while (q.front != 0)
    {
        dequeue(q, a);
        cout << a << endl;
    }
    return 0;
}