【LeetCode】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.

题解：

    计算通过value=10*value+root->val来实现，递归通过return f(root->left,value)+f(root->right,value);来实现，返回结果的边界是root->left==NULL&&root->right==NULL。

答案：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
int f(struct TreeNode* root,int value)
    {
    if(root==NULL)
    return 0;
    value=10*value+root->val;
    if(root->left==NULL&&root->right==NULL)
    return value;
    return f(root->left,value)+f(root->right,value);
    }
    
    int sumNumbers(TreeNode* root)
    {
    return f(root,0);
    }
   
};