What
is the condition that a single linked list with a header node is not
empty ?Suppose the head pointer of the linked list is first. ()
A: first
== NULL
B: first->link
== NULL
C: first->link
== first
D: first->link
== link
is the condition that a single linked list with a header node is not
empty ?Suppose the head pointer of the linked list is first. ()
A: first
== NULL
B: first->link
== NULL
C: first->link
== first
D: first->link
== link
举一反三
- 一个线性表采用带头结点的循环链表进行存储，first是头结点的指针，则判断链表为空的正确条件是（ ）。 A: first->link == NULL B: first == NULL C: first->link == first D: first->link->link == first
- 在带表头结点的单链表中，设指针first指向表头结点，当______时，表示链表为空。 A: first==NULL B: first->link==NULL C: first->link==first D: first!=NULL
- 在一个带头结点的单链表中，头结点的指针为first，那么判断这个链表为空表的条件是（ ）。 A: first == NULL B: first->link == NULL C: first->data == NULL D: first->link->link == NULL
- 判断带头结点的单链表是否为空的正确操作是（ ）。 A: first== NULL B: last==NULL C: first==last D: first->link==last
- You<br/>are given pointers to first and last nodes of a singly linked list,<br/>which of the following operations are dependent on the length of the<br/>linked list? () A: Delete<br/>the first element B: Insert<br/>a new element as a first element C: Delete<br/>the last element of the list D: Add<br/>a new element at the end of the list