1.如果p结点是第一个结点：s->data = t;s->next = p;head = s;2.如果p结点是中间结点。Node *q;q->next = p;s->data = t;q->next = s;s->next = p;
s->next=p->next;p->next=s;t=p->data;p->data=s->data;s->data=t;按照你那个填空来的
