数据结构--链队

#include <stdio.h>#include <stdlib.h>typedef struct queue{    int data;    struct queue * next;}q;q * front;q * rear; void init(void);void push(int );void pop(void);int frontdata(void);int main(void){    init();    push(10);    push(1000);    push(100);    pop();    pop();    printf("%d\n", frontdata());    return 0;} int frontdata(void){    return front->next->data;}void pop(void){    q * t;    t = front->next;    front->next = front->next->next;    if (rear == t)        rear = front;    free(t);}void push(int k){    q * newnode;    newnode = (q *)malloc(sizeof(q));    newnode->data = k;    newnode->next= NULL;    rear->next = newnode;//将新节点插入队尾     rear = newnode;//修改队尾指针 }void init(void){    front = (q *)malloc(sizeof(q));    rear = front;    front->next = NULL;}