Convert List to LinkedList

list_2_node.py

class Node:
    def __init__(self, val, next_node=None):
        self.val = val
        self.next_node = next_node
    def __repr__(self):
        return f'Node({self.val})'
# function to convert normal list to linked list
def from_list(alist):
    if len(alist) == 1:
        return Node(alist[0])
    return Node(alist[0], next_node=from_list(alist[1:]))
alist = [4, 5, 6, 7, 8]
#converting to linked list
linked_list = from_list(alist)

# Traversal of LinkedList
def traverse(node):
    if node:
        yield node
        yield from traverse(node.next_node)

# Traversal of Tree
def traverse_tree(node):
    if node:
        yield from traverse_tree(node.left)
        yield node
        yield from traverse_tree(node.right)