you can take this as far as you need to if you need to be able to move north-westnortheastsouth-eastand south-west as wellall you have to do is add these pointers to your node class singly linked lists singly linked list is list with only one pointer between two successive nodes it can only be traversed in single directionthat isyou can go from the first node in the list to the last nodebut you cannot move from the last node to the first node we can actually use the node class that we created earlier to implement very simple singly linked listn node('eggs' node('ham' node('spam'next we link the nodes together so that they form chainn next next to traverse the listyou could do something like the following we start by setting the variable current to the first item in the listcurrent while currentprint(current datacurrent current next in the loop we print out the current element after which we set current to point to the next element in the list we keep doing this until we have reached the end of the list there arehoweverseveral problems with this simplistic list implementationit requires too much manual work by the programmer it is too error-prone (this is consequence of the first pointtoo much of the inner workings of the list is exposed to the programmer we are going to address all these issues in the following sections