数据结构链表实现队列
typedef struct queue{int data;
struct queue *next;
}*queuePtr,queue;
typedef struct Que{
queue *front;
queue *rear;
}Que,*QuePtr;
==>QuePtr que=(QuePtr)malloc(sizeof(Que));
==>New=(queuePtr)malloc(sizeof(queue));
New->data=8;
New->next=NULL;
que->rear->next=New;
que->rear=New;
请问最后两句是什么意思?