public static bool HasPathSum(LeetCode112TreeNode root, int sum) { if (root == null) { return(false); } sum -= root.val; if (root.left == null && root.right == null) { return(sum == 0); } return(HasPathSum(root.left, sum) || HasPathSum(root.right, sum)); }
public LeetCode112TreeNode(int val = 0, LeetCode112TreeNode left = null, LeetCode112TreeNode right = null) { this.val = val; this.left = left; this.right = right; }