class Solution {

public:

    void helper(TreeNode* node, int path, int& sum){

        if(!node){

            return;

        }

        //a(node)

        //lk("root",node)

        //a(path)

        //dsp

        if(!node->left && !node->right){

            sum+=path*+node->val;

            //dsp

            return;

        }

        helper(node->left, path*+node->val, sum);

        helper(node->right, path*+node->val, sum);

    }

    int sumNumbers(TreeNode* root) {

        int sum=;

        //ahd(root)

        //a(sum)

        helper(root, , sum);

        return sum;

    }

};