Goal Unlike an array, a linked list has no indices — each node only knows the next one. To reach a position you walk from the head, following next pointers. That is why access and append are O(N). The code shows the actual Python traversal.