List head is a special pointer to the first item in the list.
The last node(rear) points to a NULL address
In processing a list, any node can only be accessed after having accessed all other nodes before it. This property might also be called, in other words, Strict Sequential Access (SSA).
Now let us implement the Node class so that we can have a better understanding of this structure.
Let me start with the header