1022. Sum of Root To Leaf Binary Numbers从根到叶的二进制数之和

网址：https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/

递归调用求和，同时注意%1000000007的位置

/**
 * 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 {
public:
    int getNum(TreeNode* t, int sum)
    {
        if(sum >= )
            sum %= ;
        if(t->left == NULL && t->right == NULL)
        {
            return sum*+t->val;
        }

        if(t->right && t->left)
            return getNum(t->left, sum*+t->val)%+getNum(t->right, sum*+t->val)%;
        else
            if(t->left)
                return getNum(t->left, sum*+t->val);
            else
                return getNum(t->right, sum*+t->val);
    }
    int sumRootToLeaf(TreeNode* root)
    {
        int ans = ;
        ans = getNum(root, ans);
        return ans%;
    }
};