No silly questions 1 . Here are a few pseudo codes to get you started:
def printAll (node): while node is not null: print node->payload node = node->next printAll (head)
To make this true, just start from the head of the node, print the payload and move on to the next node in the list.
Once the next node is the end of the list, stop.
1 Well, actually, probably there is, but this is not one of them :-)
source share