#include "stdio.h"
#include "stdlib.h"
#define N 100
#define TRUE 1
#define FALSE 0
typedef struct queue{
int data[N];
int front, rear;
}*pqueue,lqueue;
//置空队列
int empty(pqueue p)
{
p->front = p->rear = 0;
printf("队列已经置空!\n");
return TRUE;
}
//判断队列是否为空
int isempty(pqueue p)
{
if (p->front == p->rear)
{
printf("队列为空!\n");
return FALSE;
}
else
printf("对列不为空!\n");
return TRUE;
}
//入队操作
int enqueue(pqueue p)
{
#include "stdlib.h"
#define N 100
#define TRUE 1
#define FALSE 0
typedef struct queue{
int data[N];
int front, rear;
}*pqueue,lqueue;
//置空队列
int empty(pqueue p)
{
p->front = p->rear = 0;
printf("队列已经置空!\n");
return TRUE;
}
//判断队列是否为空
int isempty(pqueue p)
{
if (p->front == p->rear)
{
printf("队列为空!\n");
return FALSE;
}
else
printf("对列不为空!\n");
return TRUE;
}
//入队操作
int enqueue(pqueue p)
{