Singly linked lists

A linked list (also called a singly linked list) contains a number of nodes in which each node contains data and a pointer that links to the next node. The link of the last node in the list is None, which indicates the end of the list. Refer to the following linked list in Figure 4.6, in which a sequence of integers is stored.

Figure 4.6: An example of a singly linked list

Next, we discuss how to create a singly linked list, and how to traverse it.

Creating and traversing

In order to implement the singly linked list, we can use the node class that we created in the previous section. For example, we create three nodes, n1, n2, and n3, that store three strings:

n1 = Node('eggs')
n2 = Node('ham') 
n3 = Node('spam')

Next, we link the nodes sequentially to form the linked list. For example, in the following code, node n1 is pointing to node n2, node n2 is pointing to node n3, and node n3 is the last node, and...