leetcode+根节点到叶子结点的所有和，DFS

点击打开链接

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <cstring>
#include <string.h>
#include <algorithm>
#include <vector>
#include <numeric>
#include <limits>
#include <math.h>
#include <queue>
using namespace std;
struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
    int sumAll(TreeNode* root, int sum)
    {
        if(root==NULL) return 0;//空节点
        if(root->left==NULL&& root->right==NULL){//叶子结点
            return sum*10+root->val;
        }
        else{//一般节点
            return sumAll(root->left, sum*10+root->val)+sumAll(root->right, sum*10+root->val);
        }
    }
    int sumNumbers(TreeNode* root) {
        return sumAll(root, 0);
    }
};
int main()
{
    
    return 0;
}