Python's list is excellent, so why learn this? Because linked lists teach you to think in references, which is how trees and graphs (Part 4) work, and because they trade operations differently:

Operation	Python list	Linked list
get item i	O(1)	O(n), walk from the head
add at the front	O(n), everything shifts	O(1), a new head
add after a node you have	O(n)	O(1), relink two references

Adding at the front is just making a new node that points to the old head:

class Node:
    def __init__(self, value, next=None):
        self.value = value
        self.next = next

head = None
for word in ["c", "b", "a"]:
    head = Node(word, head)

values = []
node = head
while node:
    values.append(node.value)
    node = node.next
print(values)