Method printLL

Sorting Algorithims/mergesort_linkedlist.py:19–27

(self)

        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