【leetcode】路径总和

 

bool hasPathSum(struct 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);
}