LeetCode/129.cpp at master · nitin-maharana/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

/**
 * 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 {
    int sum;

    void sumNumbers(TreeNode *root, int tempSum)
    {
        if(root->left == NULL && root->right == NULL)
        {
            sum += tempSum;
            return;
        }

        if(root->left)
            sumNumbers(root->left, tempSum*10+root->left->val);

        if(root->right)
            sumNumbers(root->right, tempSum*10+root->right->val);
    }
public:
    int sumNumbers(TreeNode* root) {
        sum = 0;

        if(root == NULL)
            return 0;

        sumNumbers(root, root->val);

        return sum;
    }
};