/**
* 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 {
private:
int sum = 0;
public:
int sumNumbers(TreeNode* root) {
dfs(root,0);
return sum;
}
void dfs(TreeNode* root,int tmp)
{
if(root)
{
root->val = tmp*10 + root->val;
if(!root->left && !root->right) sum += root->val;
if(root->left) dfs(root->left,root->val);
if(root->right) dfs(root->right,root->val);
}
}
};