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就能解决。

代码：

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