单选题 An empty linked list consists of ().
A: a variable
B: two nodes
C: data and a link
D: a null head pointer
A: a variable
B: two nodes
C: data and a link
D: a null head pointer
举一反三
- What<br/>is the condition that a single linked list with a header node is not<br/>empty ?Suppose the head pointer of the linked list is first. () A: first<br/>== NULL B: first->link<br/>== NULL C: first->link<br/>== first D: first->link<br/>== link
- 单选题 In a linked list, each element contains (). A: data B: a link C: a record D: a and b
- 单选题 () is a fixed-size, sequenced collection of elements of the same data type. A: An array B: A record C: A linked list D: A variable
- 6. The most common operation for setting a linked list is to insert a node at the end and delete the tail node, so () is the most time-saving option. A: doubly linked circular list with a head node B: singly linked list C: singly linked circular list with a tail pointer D: singly linked circular list
- A Node structure in a linked list . A: consists of two parts, one for the node value and the other for a pointer to another node. B: has only one part to store the node value. C: has only one part to store the relationship pointer between the nodes. D: consists of two parts, one for the node value and the other for the number of bytes required by the node.