Multiple Choice
The successor pointer in the last node of a linked list should have its value set to
A) NULL .
B) the address of the previous node.
C) the address of the first node in the list.
D) nothing: the last node has no successor pointer.
E) None of the above
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q14: Each node in a _ list contains
Q15: Adding a new node in the middle
Q17: To concatenate two linked lists, it is
Q20: In many recursive operations on linked lists,<br>A)
Q21: A linked list class using dynamically allocated
Q22: When you delete a node from a
Q23: Which of the following are linked list
Q24: When an item stored in a linked
Q38: A new node cannot become the first
Q39: Linked lists are less complex to code