Path Sum
这一道题的时候遇到遇到空指针的错误,请大神指导
代码:
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean Tree(TreeNode node, int result){
if(node.left==null&&node.right==null){
if(result-node.val==0)
return true;
}else{
Tree(node.left,result-node.val);
Tree(node.right,result-node.val);
}
return false;
}
public boolean hasPathSum(TreeNode root, int sum) {
if(root==null){
return false;
}else{
return Tree(root,sum);
}
}
}
错误: