How to use recursion in python to print Linklist node?

Question

class Node:
    def __init__(self,data):
        self.data=data
        self.next=None

def traversal(head):
    current = head
    while current is not None:
        print(current.data)
        current = current.next
    print("End")

This is the normal node printing function. How can I transforms my traversal function to using recursion to print the node?

Answer 1

Normally a recursion has an exit check at the beginning

def traversal(node):
    if node is None:
        print("End")
        return

    print(node.data)
    traversal(node.next)

Answer 2

Something like this:

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None


def traversal(head):
    current = head
    if current is not None:
        print(current.data)
        traversal(current.next)
    else:
        print("End")