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 f(TreeNode* t,int sum){
      if(!t->left&&!t->right){
        return sum*2+t->val;
      }else{
        if(t->left&&t->right) return f(t->left,sum*2+t->val)+f(t->right,sum*2+t->val);
        else if(t->left) return f(t->left,sum*2+t->val);
        else return f(t->right,sum*2+t->val);
      }
    }
    int sumRootToLeaf(TreeNode* root) {
        int sum=0;
        return f(root,sum);
    }
};