1.1基本概念
![在这里插入图片描述](https://img-blog.csdnimg.cn/direct/72b6a2e26eae44449887be7bb5be48e4.png)
1.2实现代码
#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <stdbool.h>
typedef int QDataType;
typedef struct QListNode
{
struct QListNode* next;
QDataType val;
}QNode;
typedef struct Queue
{
QNode* phead;
QNode* ptail;
int size;
}Queue;
void QueueInit(Queue* q);
void QueuePush(Queue* q, QDataType x);
void QueuePop(Queue* q);
QDataType QueueFront(Queue* q);
QDataType QueueBack(Queue* q);
int QueueSize(Queue* q);
bool QueueEmpty(Queue* q);
void QueueDestroy(Queue* q);
#define _CRT_SECURE_NO_WARNINGS 1
#include "Queue.h"
void QueueInit(Queue* q)
{
assert(q);
q->phead = q->ptail = NULL;
q->size = 0;
}
void QueuePush(Queue* q, QDataType x)
{
assert(q);
QNode* newnode = (QNode*)malloc(sizeof(QNode));
if (newnode == NULL)
{
perror("malloc");
return;
}
newnode->val = x;
newnode->next = NULL;
if (q->ptail == NULL)
{
q->phead = q->ptail = newnode;
}
else
{
q->ptail->next = newnode;
newnode->next = NULL;
q->ptail = newnode;
}
q->size++;
}
void QueuePop(Queue* q)
{
assert(q);
assert(q->phead);
QNode* cur = q->phead;
q->phead = cur->next;
free(cur);
cur = NULL;
if (q->phead == NULL)
q->ptail = NULL;
q->size--;
}
QDataType QueueFront(Queue* q)
{
assert(q);
assert(q->phead);
return q->phead->val;
}
QDataType QueueBack(Queue* q)
{
assert(q);
assert(q->phead);
return q->ptail->val;
}
int QueueSize(Queue* q)
{
assert(q);
assert(q->phead);
return q->size;
}
bool QueueEmpty(Queue* q)
{
assert(q);
return q->phead == NULL;
}
void QueueDestroy(Queue* q)
{
assert(q);
QNode* cur = q->phead;
while (cur)
{
QNode* next = cur->next;
free(cur);
cur = next;
}
q->phead = q->ptail = NULL;
q->size =0;
}