刷题记录第六十六天-路径总和

class Solution {
public:
    bool hasPathSum(TreeNode* root, int targetSum) {
        return traverse(root,targetSum);
    }
    bool traverse(TreeNode* root,int targetSum){
        if(root==nullptr) return false;
        if(!root->left&&!root->right){
            if(targetSum==root->val){
                return true;
            }else{
                return false;
            }
        }
        bool left = traverse(root->left,targetSum-root->val);
        bool right = traverse(root->right,targetSum-root->val);
        return left||right;
    }
};