30 Day Challenge Day 15 | Leetcode 112. Path Sum

题解

Easy | Tree, DFS

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