babby's first linked list

LinkedList.py

class Node:
    def __init__(self, val = None):
        self.value = val
        self.next = None

    def printValues(self):
        n = self
        values = [n.value]

        while n.next:
            n = n.next
            values.append(n.value)

        return values

    def insertAfter(self, val):
        oldNext = self.next
        self.next = Node(val)
        self.next.next = oldNext

    def appendToTail(self, val):
        n = self

        while n.next:
            n = n.next
        
        n.next = Node(val)

    def removeDuplicates(self):
        buff = {}
        previous = Node()
        n = self

        while n:
            if(n.value in buff):
                previous.next = n.next
            else:
                buff[n.value] = True
                previous = n
            n = n.next

    def getKthToLast(self, k):
        leader = head
        follower = head

        for _ in range(k-1):
            leader = leader.next

        while(leader.next):
            leader = leader.next
            follower = follower.next

        return follower.value    

# -----------------

head = Node(5)
head.next = Node(4)
head.appendToTail(13)
head.next.insertAfter(5)
print(head.printValues())

print(head.getKthToLast(2))

head.removeDuplicates()

print(head.printValues())