129. Sum Root to Leaf Numbers

问题描述：

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.

An example is the root-to-leaf path 1->2->3 which represents the number 123.

Find the total sum of all root-to-leaf numbers.

For example,

    1
   / \
  2   3

The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.

Return the sum = 12 + 13 = 25.

解题思路：

dfs递归由根到叶子，递归参数pathsum*10+root->val，然后左右子树也递归想加：

class Solution {
public:
    int sumNumbers(TreeNode* root) {
       
        int sum=0;
        dfs(root,0,sum);
        return sum;
    }
    void dfs(TreeNode* root,int partsum,int &sum)
    {
        if(root==NULL) return;
        else if(root->left==NULL&&root->right==NULL)
            {
                sum+=partsum*10+root->val;
            }
        else {
            dfs(root->left,partsum*10+root->val,sum);
            dfs(root->right,partsum*10+root->val,sum);
        }
    }
};