recursion as illustrated in figure (aif we carry this idea furtherthen each link in the list can be thought of as linking the node to sublist of nodesas illustrated in figure (bwith this view of the listwe can print the list in reverse order by recursively printing the sublist pointed to by the node and then printing the contents of the node itself head (ahead (bfigure abstract view of the linked list as node linked to sublist of nodes the solution subdivides the problem into smaller parts of itself and contains recursive case but what about the base casewhich ends the subdivision and in turn stops the recursive callsthe recursion should stop when the next sublist is emptywhich occurs when the link field of the last node is null simple and elegant python implementation for the recursive solution is provided in listing listing the printlist(recursive function print the contents of linked list using recursion def printlistnode )if node is not none printlistnode next printnode data to help visualize how the printlist(function worksthe call stack and the linked list are illustrated in figure it assumes the main routine is defined as followsdef main()head buildlinkedlist(printlisthead