队列链式结构

#include<iostream>
#include<ctime>
using namespace std;


struct node
{
    int number;
    node *prior;
    node *next;
};

struct quene
{
    int count;
    node *front;
    node *end;
};

void inquene(quene *s, int n)
{
    node *t = new node;
    t->number = n;
    if (s->count++ == 0)
    {
        s->front = t;
        t->prior = NULL;
    }
    else
    {
        t->prior = s->end;
    }
    s->end = t;
    t->next = NULL;
}


int dequene(quene *s)
{
    if (s->count > 0)
    {
        int t;
        t = s->end->number;
        node *x = s->end;
        s->end = s->end->prior;
        delete x;
        return t;
    }
    else return -1;
}


void createquene(quene *s, int n)
{
    srand(time(0));
    for (int i = 1; i <= n; i++)
    {
        inquene(s, rand() % 100 + 1);
        //cout << s->end->number << endl;
    }
}


void main()
{
    quene *s = new quene;
    s->count = 0;
    createquene(s, 10);
    for (int i = 1; i <= 10; i++)
        cout << dequene(s) << endl;
}