code used:python class Node: def __init__(self, value): self.data_val = value self.next_node = None def insert_after(self, node): tmp_node = self.next_node self.next_node = node node.next_node = tmp_node def get_next(self): return self.next_node def print_data(self): print(self.data_val, end=", ")# TODO: Write recursive print_list() function here. if __name__ == "__main__": size = int(input()) value = int(input()) head_node = Node(value) # Make head node as the first node last_node = head_node # Insert the second and the rest of the nodes for n in range(1, size): value = int(input()) new_node = Node(value) last_node.insert_after(new_node) last_node = new_node print_list(head_node) Write a recursive function called print_list() that outputs the integer value of each node in a linked list. Function print_list() has oneparameter, the head node of a list. The main program reads the size of the linked list, followed by the values in the list. Assume the linkedlist has at least 1 node.Ex: If the input of the program is:51.2345the output of the print_list() function is:1, 2, 3, 4, 5,Hint: Output the value of the current node, then call the print_list() function repeatedly until the end of the list is reached. Refer to the Nodeclass to explore any available instance methods that can be used for implementing the print_list() function.

1. declare function print list with parameter head of linked list 2. check if current node is None…

Answered: Write a recursive function called print…

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE