A: rear-next == head
B: rear-next next == head
C: head-next == rear
D: head-next-next == rear
举一反三
- 非空的单循环链表的头指针为head,尾指针为rear, 则下列条件中总是成立的为( )。 A: rear->next == head B: rear->next >next == head C: head->next == rear D: head->next->next == rear E: head->prior == rear F: rear->prior == head
- 非空的单循环链表的头指针为head,尾指针为rear,则rear一>next=()。
- 非空的单循环链表的头指针为head,尾指针为rear,则下列条件成立的是( )。 A: ear->next->next= =head B: ear->next= =head C: head->next->next= =rea D: head->next= =rea
- 在头指针为head的非空单循环链表中,指针p指向尾结点,下列关系成立的是() A: p—>next==head B: p—>next—>Next==head C: p—>next==NULL D: p==head
- 在头指针为head的非空单循环链表中,指针p指向尾结点,下列关系成立的是() A: p->next==head B: p->next->next==head C: p->next==NULL D: p==head
内容
- 0
设单循环链表中结点的结构为(data, next),且rear是指向非空的带表头结点的单循环链表的尾结点的指针。若想删除链表第一个结点,则应执行下列哪一个操作? A: s = rear;rear = rear->next;free(s); B: rear = rear->next->next; free(rear); C: rear = rear->next;free(rear); D: s = rear->next->next;rear->next = s->next;free(s);
- 1
设单循环链表中结点的结构为(date,next),且rear是指向非空的带表头结点的单循环链表的尾结点的指针。若想删除链表的第一个结点,则应执行下列哪一个操作? A: s=rear>next->next; rear->next->next=s->next; B: rear=rear->next;free(rear); C: rear=rear->next->next; free(rear); D: s=rear->next->next;rear->next=s->next; free(s);
- 2
设单循环链表中结点的结构为(data, next),且rear是指向非空的带表头结点的单循环链表的尾结点的指针。若想删除链表第一个结点,则应执行下列哪一个操作? A: rear = rear->next;free(rear); B: s=rear->next->next; rear->next->next=s->next; C: rear = rear->next->next; free(rear); D: s = rear->next->next;rear->next = s->next;free(s);
- 3
问题:设单循环链表中结点的结构为(data, next),且rear是指向非空的带表头结点的单循环链表的尾结点的指针。若想删除链表第一个结点,则应执行下列哪一个操作?选项: A: A:s = rear->next->next;rear->next = s->next;free(s); B: B: s = rear;rear = rear->next;free(s); C: C:rear = rear->next;free(rear); D: D:rear = rear->next->next; free(rear);
- 4
问题:设单循环链表中结点的结构为(data, next),且rear是指向非空的带表头结点的单循环链表的尾结点的指针。若想删除链表第一个结点,则应执行下列哪一个操作?选项: A: A:s = rear->next->next;rear->next = s->next;free(s); B: B: s = rear;rear = rear->next;free(s); C: C:rear = rear->next;free(rear); D: D:rear = rear->next->next; free(rear);