In a linked list data structure, each element (node) is connected to the next via pointers. Elements are accessed sequentially starting from the head, which means 'where you stand, the line begins from there' - a playful reference to traversal starting from the head node.