Write an algorithm to determine if 2 linked lists intersect

DoLinkedListsIntersect.java

public class Node{
    int data;
    Node next;
    public Node(int d){
        this.data = d.
        this.next = null;
    }
}

public boolean doLinkedListsIntersect(Node root1, Node root2){
    Node curr1 = root1;
    Node curr2 = root2;
    
    while (curr1.next != null){
        curr1 = curr1.next;
    }
    while (curr2.next != null){
        curr2 = curr2.next;
    }
    
    if (curr1 == curr2){
        return true;
    }
    return false;
    
}