#include <iostream>
using namespace std;
typedef struct student
{
int data;
struct student* next;
}node;
typedef struct stackqueue
{
node *di,*top;
}queue;
queue *pushQ(queue *q,int data){
node *n=(node*)malloc(sizeof(node));//缺了*
n->data=data;
n->next=NULL;
if (q->di==NULL)//注意这个不是*q->di
{
q->di=n;
q->top=n;
}
else{
q->top->next=n;
q->top=n;
}
return q;
}