具有搜索和删除功能的python二叉树遍历

# 定义二叉树节点类
class TreeNode:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

# 搜索二叉树中的特定值
def search(root, target):
    if root is None or root.value == target:
        return root
    if target < root.value:
        return search(root.left, target)
    else:
        return search(root.right, target)

# 删除二叉树中的特定值
def delete(root, target):
    if root is None:
        return root
    if target < root.value:
        root.left = delete(root.left, target)
    elif target > root.value:
        root.right = delete(root.right, target)
    else:
        if root.left is None:
            return root.right
        elif root.right is None:
            return root.left
        else:
            min_node = find_min(root.right)
            root.value = min_node.value
            root.right = delete(root.right, min_node.value)
    return root

# 查找二叉树中的最小值节点
def find_min(node):
    while node.left is not None:
        node = node.left
    return node

# 中序遍历二叉树
def inorder_traversal(root):
    if root is not None:
        inorder_traversal(root.left)
        print(root.value)
        inorder_traversal(root.right)

# 构建一个示例二叉树
root = TreeNode(5)
root.left = TreeNode(3)
root.right = TreeNode(7)
root.left.left = TreeNode(2)
root.left.right = TreeNode(4)
root.right.left = TreeNode(6)
root.right.right = TreeNode(8)

# 搜索值为4的节点
target_node = search(root, 4)
if target_node is not None:
    print("找到了值为4的节点")
else:
    print("未找到值为4的节点")

# 删除值为4的节点
root = delete(root, 4)
print("删除值为4的节点后的中序遍历结果：")
inorder_traversal(root)