Sum Root to Leaf Numbers

Sum Root to Leaf Numbers

Description

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.

    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.

    int sumNumbers(TreeNode *root)   
    {  
        int sum = 0;  
        sumup(root, sum);  
        return sum;  
    }  
    void sumup(TreeNode *r, int &sum, int path_sum = 0)  
    {  
        if (!r) return;  
        int t = path_sum*10 + r->val;  
        sumup(r->left, sum, t);  
        sumup(r->right, sum, t);  
        if (!r->left && !r->right) sum += t;  
    }