Class LinkedList

Sorting Algorithims/mergesort_linkedlist.py:10–27

class LinkedList:
    def __init__(self):
        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
        if temp == None:
            return "Linked List is empty"
        while temp.next:
            print(temp.data, "->", end="")
            temp = temp.next
        print(temp.data)
        return


# Merge two sorted linked lists