2 односвязных пересечения списка

Я пытаюсь создать 2 одиночных связанных списков и найти пересечение между ними. Я получаю ошибки, такие как NameError: obj не определен для линии LinkedList и хотел бы получить рабочее решение. Как это сделать? Что я делаю неправильно? Я даже близко? В чем смысл жизни? Это в python.

class IntersectSolution:
    def intersect(sll_a, sll_b):
        b_x_node = sll_b
        while sll_b and not sll_a.search(sll_b.get_data()):
            sll_b.get_next()
            b_x_node = sll_b
        if b_x_node == None:
            print("No intersections between nodes.")
        print("Intersection node is: {}".format(b_x_node))

class Node:
    def __init__(self, data = None, next_node = None):
        self.data = data
        self.next_node = next_node

    def get_data(self):
        return self.data

    def get_next(self):
        return self.next_node

    def set_next(self, new_node):
        self.next_node = new_node

class LinkedList(obj):
    def __init__(self, head = None):
        self.head = head

    def insert(self, data):
        new_node = Node(data)
        new_node.set_next(self.head)
        self.head = new_node

    def size(self):
        current = self.head
        count = 0
        while current:
            count += 1
            current = current.get_next
        return count

    def search(self, data):
        current = self.head
        found = False
        while current and found is False:
            if current.get_data() == data:
                found = True
            else:
                current = current.get_next()
        if current is None:
            raise ValueError("Data not in list")
        return current

    def delete(self, data):
        current = self.head
        previous = None
        found = False
        while current and found is False:
            if current.get_data() == data:
                found = True
            else:
                previous = current
                current = current.get_next()
        if current is None:
            raise ValueError("Data not in list")
        if previous is None:
            self.head = current.get_next()
        else:
            previous.set_next(current.get_next())

a = LinkedList(Node)
b = LinkedList(Node)
for i in range(1, 15, 2):
    a.insert(i)
for j in range(23, 8, -3):
    b.insert(j)

ISoln = IntersectSolution
ISoln.intersect(a,b)