reverse starting ll python

# program to reverse starting k elements of Linked List

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

    # method adds elements to the left of the Linked List
    def addToStart(self, data):
        # create a temporary node
        tempNode = Node(data)
        tempNode.setLink(self.head)
        self.head = tempNode
        del tempNode

    # method adds elements to the right of the Linked List
    def addToEnd(self, data):
        start = self.head
        tempNode = Node(data)
        while start.getNextNode():
            start = start.getNextNode()
        start.setLink(tempNode)
        del tempNode
        return True

    # method displays Linked List
    def display(self):
        start = self.head
        if start is None:
            print("Empty List!!!")
            return False

        while start:
            print(str(start.getData()), end=" ")
            start = start.link
            if start:
                print("-->", end=" ")
        print()


# node class
class Node:
    # default value of data and link is none if no data is passed
    def __init__(self, data=None, link=None):
        self.data = data
        self.link = link

    # method to update the data feild of Node
    def updateData(self, data):
        self.data = data

    # method to set Link feild the Node
    def setLink(self, node):
        self.link = node

    # method returns data feild of the Node
    def getData(self):
        return self.data

    # method returns address of the next Node
    def getNextNode(self):
        return self.link


# function to reverse first k nodes of a linked list
def reverse_K_nodes(head, k):
    currentNode = head
    nextNode = None
    prevNode = None

    # reverse first k nodes
    while currentNode is not None and k != 0:
        nextNode = currentNode.getNextNode()
        currentNode.setLink(prevNode)
        prevNode = currentNode
        currentNode = nextNode
        k -= 1

    # assign head as prevNode
    head = prevNode
    currentNode = head

    # join the link between current node and the rest of the linked list
    while currentNode.getNextNode() is not None:
        currentNode = currentNode.getNextNode()
    currentNode.setLink(nextNode)

    return head




# main method
# creating LinkedList
print("Program to reverse first k nodes of the Linked List")
myList = LinkedList()
myList.addToStart(1)
myList.addToEnd(2)
myList.addToEnd(3)
myList.addToEnd(4)
myList.addToEnd(5)
myList.addToEnd(6)
myList.addToEnd(7)
myList.addToEnd(8)
myList.addToEnd(9)
myList.addToEnd(10)
myList.addToEnd(11)
myList.display()

print("Reversing the first 4 nodes of the linked list")
myList.head = reverse_K_nodes(myList.head, 4)

myList.display()