leetcode-problems/129.cpp at main · nikhilsahu-0/leetcode-problems · 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
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int sum = 0;

    void solve(TreeNode *root,int n){
        if(root->left == NULL && root->right == NULL){
            sum += n*10+root->val;
        }else{
            if(root->left == NULL)solve(root->right,(n*10)+root->val);
            else if(root->right == NULL)solve(root->left,(n*10)+root->val);
            else {
                solve(root->right,(n*10)+root->val);
                solve(root->left,(n*10)+root->val);
            }
        }
    }

    int sumNumbers(TreeNode* root) {
        if(root->left == NULL && root->right == NULL)return root->val;

        solve(root,0);
        return sum;
    }
};