This type of list does not contain a null pointer at the end of the list.
A)circular-linked
B)doubly-linked
C)backwards-linked
D)null-linked
E)None of these

Question

Quizplus · Accepted Answer

Circular-linked lists do not contain a null pointer at the end, as the last node points back to the first node in the list. Doubly-linked lists have pointers in both directions, but still typically use a null pointer to mark the end of the list. Backwards-linked and null-linked lists are not common terms in the context of data structures.

This Type of List Does Not Contain a Null Pointer