c语言 实现队列（插入，删除，头部，尾部，销毁）_c队列删除队头

1、代码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

// 节点结构体
struct QueueNode
{
    struct QueueNode* next;
};

// 队列结构体
struct LQueue
{
    struct QueueNode phade;
    struct QueueNode* ptail;
    int m_size;
};

typedef void* LinkQueue;

// 初始化
void* init_Queue()
{
    struct LQueue* myqueue = (struct LQueue*)malloc(sizeof(struct LQueue));
    if(myqueue==NULL)
        return NULL;
    myqueue->m_size = 0;
    myqueue->phade.next = NULL;
    myqueue->ptail = &(myqueue->phade);
    return (void*)myqueue;
}

// 入队操作
void push_Queue(LinkQueue queue,void* data)
{  
    if(queue==NULL||data==NULL)
        return;
    // 本质尾插
    struct LQueue* myqueue = (struct LQueue*)queue;
    struct QueueNode* mynode = (struct QueueNode*)data;
    myqueue->ptail->next = mynode;
    mynode->next = NULL;

    // 尾节点
    myqueue->ptail = mynode;
    myqueue->m_size++;
}

// 入队操作
void pop_Queue(LinkQueue queue)
{  
    if(queue==NULL)
        return;
    
    // 头删
    struct LQueue* myqueue = (struct LQueue*)queue;
    if(myqueue->m_size==0)
        return;
    if(myqueue->m_size==1)
    {
        myqueue->phade.next = NULL;
        myqueue->ptail = &(myqueue->phade);
        myqueue->m_size--;
        return;
    }
    struct QueueNode* del = myqueue->phade.next;

    myqueue->phade.next = del->next;
    myqueue->m_size--;
}

// 返回队列大小
int size_queue(LinkQueue queue)
{
    if(queue==NULL)
        return -1;
    struct LQueue* myqueue = (struct LQueue*)queue;
    return myqueue->m_size;
}

// 返回头数据
void* front_queue(LinkQueue queue)
{
    if(queue==NULL)
        return NULL;
    struct LQueue* myqueue = (struct LQueue*)queue;
    return myqueue->phade.next;
}

void* back_queue(LinkQueue queue)
{
    if(queue==NULL)
        return NULL;
    struct LQueue* myqueue = (struct LQueue*)queue;
    return myqueue->ptail;
}

int isempty_queue(LinkQueue queue)
{
    if(queue==NULL)
        return -1;
    struct LQueue* myqueue = (struct LQueue*)queue;
    if(myqueue->m_size==0)
        return 1;
    return 0;
}

void destroy_queue(LinkQueue queue)
{  
    if(queue==NULL)
        return;
    free(queue);
}

// 测试
struct person1
{
    void* node; // 预留4个字节
    char name[64];
    int age;
};

int main()
{
    LinkQueue myqueue = init_Queue();
    struct person1 p2 = {NULL,"bbb",52};
    struct person1 p1 = {NULL,"aaa",12};
    struct person1 p3 = {NULL,"ccc",15};
    struct person1 p4 = {NULL,"ddd",32};
    push_Queue(myqueue,&p2);
    push_Queue(myqueue,&p1);
    push_Queue(myqueue,&p3);
    push_Queue(myqueue,&p4);
    while(isempty_queue(myqueue)==0)
    {
        struct person1* p5 = (struct person1*)front_queue(myqueue);
        printf("%s %d\n",p5->name,p5->age);
        pop_Queue(myqueue);
    }
    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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142