160 Intersection of Two Linked Lists (Kieran)

class Solution:
    def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
        visited = set()
        while headA or headB:
            if headA:
                if headA in visited:
                    return headA
                else:
                    visited.add(headA)
                headA=headA.next
            if headB:
                if headB in visited:
                    return headB
                else:
                    visited.add(headB)
                headB=headB.next

        return None