如何在二叉搜索树中包含带有插入函数的父指针

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None
        self.parent = None

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

    def insert(self, value):
        if self.root is None:
            self.root = TreeNode(value)
        else:
            self._insert_recursive(self.root, value)

    def _insert_recursive(self, node, value):
        if value < node.value:
            if node.left is None:
                new_node = TreeNode(value)
                new_node.parent = node
                node.left = new_node
            else:
                self._insert_recursive(node.left, value)
        else:
            if node.right is None:
                new_node = TreeNode(value)
                new_node.parent = node
                node.right = new_node
            else:
                self._insert_recursive(node.right, value)

    # 其他操作函数（例如搜索、删除等）可以根据需要进行实现