Очередь

#include <iostream>
using namespace std;

struct Node{
    int d;
    Node *next;
};

void add(Node *&begin, Node *&end, int d)
{
    Node *cur = new Node;
    cur->d = d;
    cur->next = nullptr;
    if (end) end->next = cur;
    else begin = cur;
    end = cur;
}
int del(Node *&begin){
    int data = begin->d;
    Node *cur = begin;
    begin = begin->next;
    delete cur;
    return data;
}

int main(){
    Node *begin = nullptr, *end = nullptr;
    for (int i = 1; i < 6; ++i) add(begin, end, i);
    while (begin)
        cout << del(begin) << ' ';
}