112. 路径总和

题目链接

/**
 * @param {TreeNode} root
 * @param {number} targetSum
 * @return {boolean}
 */
var hasPathSum = function(root, targetSum) {
    if (!root) return false;
    if (!root.left && !root.right) {
        return root.val === targetSum? true: false;
    }
    const remain = targetSum - root.val;
    const leftCheck = root.left? hasPathSum(root.left,remain): false;
    const rightCheck = root.right? hasPathSum(root.right,remain): false;
    return leftCheck || rightCheck;
};