在Python中对n元树的所有节点求和

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

def sum_of_nodes(root):
    if not root:
        return 0
    
    total_sum = root.value
    for child in root.children:
        total_sum += sum_of_nodes(child)
    
    return total_sum

# 创建一个n元树
root = TreeNode(1)
child1 = TreeNode(2)
child2 = TreeNode(3)
child3 = TreeNode(4)
child4 = TreeNode(5)

root.children = [child1, child2]
child1.children = [child3]
child2.children = [child4]

# 求和
sum = sum_of_nodes(root)
print("n元树的所有节点求和为:", sum)

n元树的所有节点求和为: 15