如何在go中创建递归并发树搜索

type Node struct {
    Value int
    Children []Node
}

func search(node Node, target int, result chan<- bool) {
    if node.Value == target {
        result <- true
        return
    }
    for _, child := range node.Children {
        go search(child, target, result)
    }
}

func main() {
    // 创建树结构
    tree := Node{
        Value: 1,
        Children: []Node{
            {Value: 2},
            {Value: 3},
            {Value: 4},
        },
    }

    // 创建结果通道
    result := make(chan bool)

    // 启动搜索
    go search(tree, 3, result)

    // 等待结果
    fmt.Println(<-result)
}