insert method for linked list in python

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

class LinkedList:
    def __init__(self):
        self.head = None

    def insert(self, data, position=None):
        new_node = Node(data)

        if position is None:
            if self.head is None:
                self.head = new_node
            else:
                curr_node = self.head
                while curr_node.next is not None:
                    curr_node = curr_node.next
                curr_node.next = new_node
        else:
            if position == 0:
                new_node.next = self.head
                self.head = new_node
            else:
                prev_node = None
                curr_node = self.head
                for i in range(position):
                    prev_node = curr_node
                    curr_node = curr_node.next
                    if curr_node is None:
                        break
                new_node.next = curr_node
                prev_node.next = new_node
1029 chars
35 lines