How to find the merge point for two linked lists

class Node:
    def __init__(self, data):
        self.data = data 
        self.next = None  
class SinglyLinkedList:
    def __init__(self):
        self.head = None
        self.tail = None
    def print_ll(self):
        temp = self.head
        while temp:
            print(str(temp.data))
            temp = temp.next
  
    def insert(self, data):
        node = Node(data)
        if not self.head:
            self.head = node
        else:
            self.tail.next = node
        self.tail = node
  
l1 = SinglyLinkedList()
l1val = [1,2,3,4,5]
for i in l1val:
    l1.insert(i)
    
l1.print_ll()

class SinglyLinkedListNode:
    def __init__(self, data):
        self.data = data
        self.next = None
class SinglyLinkedList:
    def __init__(self):
        self.head = None
        self.tail = None
    def insert(self, data):
        node = SinglyLinkedListNode(data)
        if not self.head:
            self.head = node
        else:
            self.tail.next = node
        self.tail = node
def merge_point(head1, head2):
    data = []
    while head1 != None:
        data.append(head1)
        head1 = head1.next
    while head2 != None:
        if head2 in data:
            return (head2.data)
        head2 = head2.next
l1 = SinglyLinkedList()
l1val = [1,2,3,4,5]
l1_count = 5
for i in l1val:
    l1.insert(i)
l2 = SinglyLinkedList()
l2val = [9,2]
l2_count = 2
for i in l2val:
    l2.insert(i)
ptr1 = l1.head;
ptr2 = l2.head;
for i in range(l1_count):
    if i < 3:
        ptr1 = ptr1.next
        
for i in range(l2_count):
    if i != l2_count-1:
        ptr2 = ptr2.next
ptr2.next = ptr1
print(merge_point(l1.head, l2.head))