向建立好的单向链表中的结点pr后插入一个新结点p,且所有结点都已具有如下形式的结构定义: struct node { int data; struct node *next; }*p, *pr, *head; 则操作正确的是
A、p->next = pr->next; pr->next = p;
B、struct node * pTemp; pTemp = pr->next; pr->next = p; p->next = pTemp;
C、pr->next = p;
D、p->next = pr->next; pr = p;
E、pr->next = p; p->next = pr->next;