c++ - 我的逻辑正确吗？它给出了段错误

Question

我想找到二叉树中从根到叶子的最大和。最初我正在做:Answer= sum_to_leaf(root,0);我知道另一种方法来探索所有路径并更新总和的全局最大值。我只是想这样做。

int sum_to_leaf(struct node* root, int sum)
{
    if(root == NULL)
        return sum;

    else if(root->left == NULL && root->right == NULL)
    {
        sum = sum + root->data;
        return sum;
    }
    else
    {
        sum = sum + root->data;
        if(sum_to_leaf(root->left, sum) > sum_to_leaf(root->right, sum))
        {
            sum = sum + sum_to_leaf(root->left, sum);
        }
        else
        {
            sum = sum + sum_to_leaf(root->right, sum);
        }
        return sum; 
    } 
}

Answer 1

嗯，您确定段错误来自该代码吗？你调试过吗？我宁愿尝试这个:

int sum_to_leaf(struct node* root,int sum) {

    if(root==NULL) {
        return sum;    
    } else {
        sum=sum+root->data;
        int left_sum = sum_to_leaf(root->left, sum);
        int right_sum = sum_to_leaf(root->right, sum);

        return std::max(left_sum, right_sum); // need to #include <algorithm>
    }

}