Intersection of Two Linked Lists LeetCode solution in JavaScript

1
var getIntersectionNode = function (headA, headB) {
2
  let node1 = headA;
3
  let node2 = headB;
4

5
  const set = new Set();
6

7
  while (node1 !== undefined || node2 !== undefined) {
8
    if (node1 && set.has(node1)) {
9
      return node1;
10
    }
11
    if (node2 && set.has(node2)) {
12
      return node2;
13
    }
14
    if (node1) {
15
      set.add(node1);
16
      node1 = node1.next;
17
    } else if (node2) {
18
      set.add(node2);
19
      node2 = node2.next;
20
    } else {
21
      return;
22
    }
23
  }
24
};