leetcode 129. 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.

Note: A leaf is a node with no children.

Example:

Input: [1,2,3]
    1
   / \
  2   3
Output: 25
Explanation:
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Therefore, sum = 12 + 13 = 25.

Example 2:

Input: [4,9,0,5,1]
    4
   / \
  9   0
 / \
5   1
Output: 1026
Explanation:
The root-to-leaf path 4->9->5 represents the number 495.
The root-to-leaf path 4->9->1 represents the number 491.
The root-to-leaf path 4->0 represents the number 40.
Therefore, sum = 495 + 491 + 40 = 1026.

 

/**
 * 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 {
    
private:
    void helper(TreeNode* node, int &sum, int parent_val) {
        if (!node) {
            return;
        }
    
        if (!node->left && !node->right) {
            sum += (parent_val * 10 + node->val);
        }
        else {
           helper(node->left, sum, (parent_val*10 + node->val));
           helper(node->right, sum, (parent_val*10 + node->val)); 
        }
    }
    
    
public:
    int sumNumbers(TreeNode* root) {
        
        if (!root) {
            return 0;
        }
        
        int sum = 0;
        int parent_val = 0;
        helper(root, sum, parent_val);
        return sum;
    }
};