The last node of a linear linked list ______.
A)has the value null
B)has a next reference whose value is null
C)has a next reference which references the first node of the list
D)cannot store any data

Question

Quizplus · Accepted Answer

The last node of a linear linked list has a next reference whose value is null, indicating that it is the end of the list. It does not reference the first node of the list or store any data. Therefore, option B is the correct choice. Option A is incorrect because the value of the last node could be any data type, not just null. Option C is incorrect because the last node cannot reference the first node as it would create a circular linked list. Option D is incorrect because the last node can store data, but its next reference is null.

The Last Node of a Linear Linked List ______