[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:
    int calcRec(TreeNode* root, int prev) {
        if(root == NULL) return 0;
        int x = prev * 10 + root->val;
        if(root->left == NULL && root->right == NULL)
            return x;
        return calcRec(root->left, x) + calcRec(root->right, x);
    }
    int sumNumbers(TreeNode *root) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        return calcRec(root, 0);
    }
};

原题：http://oj.leetcode.com/problems/sum-root-to-leaf-numbers/