Найти сумму всех путей из вершины v

#include <iostream>
#include <vector>
 
using namespace std;
 
struct TreeNode {
    int weight;
    vector<TreeNode*> children;
};
 
void dfs(TreeNode* node, vector<int>& subtree_size, vector<int>& subtree_sum, int& total_nodes, int& total_sum) {
    subtree_size[node] = 1;
    subtree_sum[node] = node->weight;
 
    for (TreeNode* child : node->children) {
        dfs(child, subtree_size, subtree_sum, total_nodes, total_sum);
        subtree_size[node] += subtree_size[child];
        subtree_sum[node] += subtree_sum[child];
    }
 
    total_nodes += subtree_size[node];
    total_sum += subtree_sum[node];
}
 
void calculatePathSums(TreeNode* node, vector<int>& result, vector<int>& subtree_size, vector<int>& subtree_sum, int total_nodes, int total_sum) {
    result[node] = subtree_size[node] * node->weight + subtree_sum[node] + (total_nodes - subtree_size[node]) * node->weight + (total_sum - subtree_sum[node]);
 
    for (TreeNode* child : node->children) {
        calculatePathSums(child, result, subtree_size, subtree_sum, total_nodes, total_sum);
    }
}
 
vector<int> sumOfPaths(TreeNode* root) {
    if (!root) {
        return {};
    }
 
    int total_nodes = 0;
    int total_sum = 0;
    vector<int> subtree_size(root, 0);
    vector<int> subtree_sum(root, 0);
 
    dfs(root, subtree_size, subtree_sum, total_nodes, total_sum);
 
    vector<int> result(root, 0);
    calculatePathSums(root, result, subtree_size, subtree_sum, total_nodes, total_sum);
 
    return result;
}
 
int main() {
    // Пример использования
    TreeNode* root = new TreeNode{1, {new TreeNode{2, {new TreeNode{4, {}}, new TreeNode{5, {}}}}, new TreeNode{3, {}}}};
    
    vector<int> result = sumOfPaths(root);
 
    cout << "Sum of paths for each node:\n";
    for (int i = 0; i < result.size(); ++i) {
        cout << "Node " << i + 1 << ": " << result[i] << "\n";
    }
 
     return 0;
}