Which operation on a singly linked list requires traversal from the head in the worst case?

In a circular linked list, the last node's next pointer points to:

A doubly linked list differs from a singly linked list because each node also stores:

The primary advantage of a linked list over an array is:

A self-referential structure is one that contains:

A weighted graph is one in which:

A skip list improves search performance over an ordinary linked list by: