leetcode: 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.

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:

    void foo(TreeNode *root, int &curSum, int &retSum) {
        
        curSum = curSum*10+root->val;
        
        if (root->left == NULL && root->right == NULL)
        {
            retSum += curSum;
            return;
        }
        
        if (root->left)
        {
            foo(root->left, curSum, retSum);
            curSum = curSum/10;           
        }

        if (root->right)
        {
            foo(root->right, curSum, retSum);
            curSum = curSum/10;            
        }

    }
    
    int sumNumbers(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        
        if (root == NULL)
            return 0;
            
        int retSum = 0;
        int curSum = 0;
        
        foo(root, curSum, retSum);
        
        return retSum;
        
    }
};