112. Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
For example:
Given the below binary tree and 

sum
= 22

,

5
/ \
4   8
/   / \
11  13  4
/  \      \
7    2      1

return true, as there exist a root-to-leaf path 

5->4->11->2

 which sum is 22.
Solution 1
1ms 9.61%

public class Solution {
public boolean hasPathSum(TreeNode root, int sum) {
if (root == null) {
return false;
}
if (root.left == null && root.right == null) {
return sum == root.val;
}
return hasPathSum (root.left, sum - root.val)
|| hasPathSum(root.right, sum - root.val);
}
}
Solution 2

1ms 9.61%

public class Solution {
public boolean hasPathSum(TreeNode root, int sum) {
return calcSum(root, 0, sum);
}
public boolean calcSum(TreeNode root, int result, int sum){
if(root == null){
return false;
}
if(root.left == null && root.right == null){
return result + root.val == sum;
}
return calcSum(root.left, root.val + result, sum) || calcSum(root.right, root.val + result, sum);
}
}