Leetcode-5017 Sum of Root To Leaf Binary Numbers(从根到叶的二进制数之和)

typedef long long ll;
class Solution
{
    public:
        ll rnt = 0;
        void go(TreeNode* root,int val)
        {
            val = (val*2+root->val)%1000000007;
            if(root->left==NULL && root->right==NULL)
            {
                rnt = (rnt+val)%1000000007;return ;
            }
            if(root->left)
            go(root->left,val);
            if(root->right)
            go(root->right,val);
        }
        int sumRootToLeaf(TreeNode* root)
        {
            if(!root) return 0;
            go(root,0);
            return rnt;
        }
};

没取余WA了两发，气死我了