尝试在球拍n-ary中写Foldtree只知道如何写二叉树

class Node:
    def __init__(self, value):
        self.value = value
        self.children = []

def Foldtree(root):
    if root is None:
        return None
    
    # 如果根节点没有子节点，直接返回根节点的值
    if len(root.children) == 0:
        return root.value
    
    # 递归处理每个子节点，并将结果进行折叠
    result = root.value
    for child in root.children:
        result = fold_func(result, Foldtree(child))
    
    return result

# 创建n-ary树的示例
root = Node(1)
child1 = Node(2)
child2 = Node(3)
child3 = Node(4)
root.children = [child1, child2, child3]

# 调用Foldtree函数进行折叠
result = Foldtree(root)
print(result)