![](https://static.youtibao.com/asksite/comm/h5/images/m_q_title.png)
[单选题]
在头指针为head的非空单循环链表中,指针p指向尾结点,下列关系成立的是 ()
A.p—>next==head
B.p—>next—>Next==head
C.p—>next==NULL
D.p==head
查看答案
![](https://static.youtibao.com/asksite/comm/h5/images/solist_ts.png)
A.p—>next==head
B.p—>next—>Next==head
C.p—>next==NULL
D.p==head
A.rear->next==head
B.rear->next->next==head
C.head->next==rear
D.head->next->next==rear
A.head=NULL
B.head->next=NULL
C.head!=NULL
D.head->next!=head
设一条单链表的头指针变量为head且该链表没有头结点,则其判空条件是()。
A.head==0
B.head->next==0
C.head->next==head
D.head!=0
A.head==NULL
B.head->next=NULL
C.head->next=head
D.head!=NULL
非空的循环单链表head的尾结点(由指针p所指)满足()
A.p—>next=NULL
B.p=NULL
C.p—>next=head
D.p=head
# define NULL 0
void Traversal(NODE。 head)
(NODE*p;
p= head;
/*p为工作指针。/
do
(printf("%d/n", p- >data);
〉while(p! = NULL);
函数中空格部分的选项为:
A. head= p- > next
B. p=head- >next
C. p=p- > next
D. head=head- > next