如何将类对象存储到二进制搜索树节点中？

import pickle

class BSTNode:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None

class BST:
    def __init__(self):
        self.root = None

    def insert(self, data):
        node = BSTNode(pickle.dumps(data))
        if self.root is None:
            self.root = node
        else:
            current = self.root
            while True:
                if data < pickle.loads(current.data):
                    if current.left is None:
                        current.left = node
                        break
                    else:
                        current = current.left
                else:
                    if current.right is None:
                        current.right = node
                        break
                    else:
                        current = current.right

    def search(self, data):
        target = pickle.dumps(data)
        current = self.root
        while current is not None:
            if target == current.data:
                return pickle.loads(current.data)
            elif target < current.data:
                current = current.left
            else:
                current = current.right
        return None

# 示例使用
bst = BST()

# 插入类对象
class MyClass:
    def __init__(self, name):
        self.name = name

obj1 = MyClass("object 1")
obj2 = MyClass("object 2")
bst.insert(obj1)
bst.insert(obj2)

# 搜索类对象
result = bst.search(obj1)
print(result.name)  # 输出 "object 1"