1022. 从根到叶的二进制数之和

原题链接：1022. 从根到叶的二进制数之和

solution:

递归

class Solution {
public:
    int sumRootToLeaf(TreeNode* root) {
        return dfs(root, 0);
    }

    int dfs(TreeNode *root,int val) {
        if(root == nullptr) return 0;
        val = val * 2 + root->val;
        if(root->left == nullptr && root->right == nullptr) return val;
        int left = dfs(root->left, val);
        int right = dfs(root->right, val);
        return left + right;
    }
};