Solve it in python

Question

2) Implement a recursive algorithm which will print all the elements of a non-dummy headed singly linked linear list in reversed order.

Example: if the linked list contains 10, 20, 30 and 40, the method will print

40

30

20

10

Note: you’ll need a Singly Node class for this code.

You can use the following singly linked list class to execute the code.

class Node:

   def __init__(self, data):

       self.data = data

       self.next = None

class Mylist:

   def __init__(self, lst):

       self.head = None

       for i in lst:

           new_node = Node(i)

           if self.head == None:

               self.head = new_node

           else:

               last = self.head

               while (last.next):

                   last = last.next

               last.next = new_node

   def pr(self):

       print('-------Printing Linked List--------')

       temp = self.head

       while (temp):

           print(temp.data)

           temp = temp.next

       print('------------------------------------')

if __name__ == '__main__':

lst = Mylist([10,20,30,40,50])

Please solve it properly so the code works accordingly.

Answer 1

There are two important steps in this problem:

(1) Modify the pr() method so it calls itself recursively. You'll know this works when pr() calls itself recursively, doesn't crash, and prints out the node values in forward or reverse order, or possibly both.

(2) Note that the code will behave differently depending on where you print the node value relative to the recursive method call. Try changing the location of the print() statement in your recursive code.