【二叉树】129. Sum Root to Leaf Numbers

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