在循环双链表的p所指的结点之前插入s所指结点的操作是 ( )
A. p->prior = s;s->next = p;p->prior->next = s;s->prior = p->prior;
B. p->prior = s;p->prior->next = s;s->next = p;s->prior = p->prior;
C. s->next = p;s->prior = p->prior;p->prior = s;p->prior->next = s;
D. s->next = p;s->prior = p->prior;p->prior->next = s;p->prior = s;
带头结点的单链表head为空的判定条件是( )
A. head==NULL
B. head->next==NULL
C. head->prior==NULL
D. head->prior==0
在一个单链表中,已知q所指结点是p所指结点的前驱结点,若在q和p之间插入s结点,则执行( )
A. p->next=s->next; s->next=p;
B. s->next=p;q->next=s;
C. s->next=p;p->next=s->next;
D. q->next=s->next;s->next=p;
非空的循环单链表head的尾节点(由p指向)满足p->next==Null
A. 对
B. 错