c++结构体实现链队列_c++如何让结构体进入队列

可以先copy下来测试一下，慢慢学

#include <iostream>
using namespace std;
struct Node //定义队列的节点
{
    Node *next;
    double data;
};
struct Queue //定义队列的数据结构
{
    Node *front;
    Node *rear;
};
void Initqueue(Queue &queue) //初始化一个空队列
{
    Node *p;
    p = new Node;
    p->next = NULL; //队首
    queue.front = p;
    queue.rear = p;
}
void Pushqueue(Queue &queue, double a)
{
    Node *p;
    p = new Node;
    p->next = NULL;
    p->data = a;
    queue.rear->next = p;
    queue.rear = p;
}
void Popqueue(Queue &queue, double &a)
{
    Node *p;
    p = queue.front->next; //p指向将要删除的节点
    a = p->data;
    queue.front->next = p->next; //将中间节点丢掉
    if (p == queue.rear)
        queue.rear = queue.front;
    delete p;
}
int Isempty(Queue &queue)
{
    if (queue.front == queue.rear)
    {
        return 0;
    }
    else
    {
        return 1;
    }
}
void Deletequeue(Queue &queue)
{
    while (queue.front)
    {
        queue.rear = queue.front;
        delete queue.front;
        queue.front = queue.rear;
    }
}
int main()
{
    Queue *queue1;
    queue1 = new Queue;
    Initqueue(*queue1);
    double a, x = 0;
    cout << "please input an data,if data==-1:--end--" << endl;
    cin >> a;
    while (a != -1)
    {
        Pushqueue(*queue1, a);
        cout << "please input an data,if data==-1:--end--" << endl;
        cin >> a;
    }
    Node *p, *q;
    p = queue1->front->next;
    q = p;
    if (p == NULL)
    {
        cout << "队列为空" << endl;
        return 0;
    }
    cout << "All elements" << endl;
    while (p != NULL)
    {
        cout << p->data << " ";
        p = p->next;
    }
    cout << endl;
    while (Isempty)
    {
        Popqueue(*queue1, x);
        cout << "deleting" << x << endl;
    }
    Deletequeue(*queue1);
    delete queue1->front;
    delete queue1;
    system("pause");
    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99

另外还有☟☟
用类实现链队列/顺序表