sum-root-to-leaf-numbers

gistfile1.txt

https://oj.leetcode.com/problems/sum-root-to-leaf-numbers/

int sumNumbers(TreeNode *root) {
        if(!root) return 0;
        
        vector<int> sum;
        sum.push_back(root->val);
        
        if(!root->left && !root->right) return root->val;
        
        return sumNumbers(root->left, sum) + sumNumbers(root->right, sum);
    }
    
    int sumNumbers(TreeNode* node, vector<int> sum) {
        if(!node) return 0;
        
        sum.push_back(node->val);
        
        if(!node->left && !node->right) { //leaf node
            int temp=0;
            for(int i= sum.size()-1; i >= 0 ; i--) temp += sum[i] * pow(10, (sum.size()-1)-i);
            
            return temp;
        }
        
        return sumNumbers(node->left, sum) + sumNumbers(node->right, sum);
    }