Append nodes, then search the list and watch each node visited in turn.
Search is O(n) because there is no index — each node can only be reached from its predecessor.
Three nodes chained head to tail.