Compare two linked lists of string chunks

Two singly linked lists each hold pieces of text, one piece per node (in the reported version, one character per node stored as a string). Decide whether both lists spell the same text. Do it by walking both lists in step, without building the full strings, which matters once nodes can hold chunks of different lengths.