After we have learned how to create and connect nodes, we need to check that such a list works correctly!

To do this, let's write a simple function that will display the entire list.

The function will accept a pointer to the memory area where the head (first) node of the list is stored.

After which a temporary node current will be created, with which we will go through the entire list. The content of the current node will be equal to the content of the current list node.

To iterate through the list, we use the while(){} loop with the necessary condition, namely, until a node is found whose next field is NULL.

Inside the loop, we will display the contents of the data field of the current node and change the next field to move to the next node.

As soon as a node is found whose next field equal NULL, the loop will stop displaying the contents of the nodes and the function will end.

As practice, you will complete a function to dynamically free memory. The function will work using a similar method - iterating through nodes through a loop and “releasing” them.

Note

The temp (temporary) node plays the role of a buffer node. It is needed to temporarily store (and delete) the contents of the current node. If we immediately clear the current node, we will lose connection with the next node, which means access to the list will be lost.