Multiple Choice
While traversing a list, a node pointer knows when it has reached the end of a list when:
A) it encounters the newline character
B) it encounters a null pointer
C) it finds itself back at the beginning of the list
D) it encounters a sentinel, usually 9999
E) None of these
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q8: Nodes in a linked list are stored
Q12: Deleting an entire list requires traversing the
Q14: To insert a new node in ascending
Q18: The last node in a linked list
Q18: The Standard Template Library (STL) provides a
Q20: Variations of the linked list are:<br>A)doubly-linked list<br>B)circular
Q23: A new node must always be made
Q33: A doubly linked list keeps track of
Q38: A new node cannot become the first
Q39: Linked lists are less complex to code