Method insert

Sorting Algorithims/mergesort_linkedlist.py:14–17

(self, new_data: int)

        self.head = None

    def insert(self, new_data: int) -> None:
        new_node = Node(new_data)
        new_node.next = self.head
        self.head = new_node

    def printLL(self) -> None:
        temp = self.head