What is the output of the traversal algorithm for a linked list?

• A. It processes and prints the data of each node until reaching nullptr
• B. It prints only the head node
• C. It prints the last node
• D. It prints memory addresses of all nodes

Answer: (A)

Linked list traversal visits each node in order from the head to the end, typically to access or display the data stored in every node. In a standard traversal that outputs node data, you start at the head, print its data, move to the next node, and continue until you reach a null pointer that marks the end. That behavior means the output is the data of every node, in sequence, until you reach nullptr.

If you only printed the head, you’d miss all the remaining nodes; if you printed only the last node, you’d omit everything that came before it; printing memory addresses would show pointer values, not the node data. So the correct output is the data from all nodes, in order from head to end.