Path Sum

public class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(root == null)
            return false;
        boolean[] result = new boolean[1];
        traversal(root, sum, result);
        return result[0];
    }
    
    private void traversal(TreeNode root, int sum, boolean[] result)
    {
        if(root.left == null && root.right == null){
            if(sum == root.val)
                result[0] = true;;
            return;}
        if(root.left != null)
            traversal(root.left, sum - root.val, result);
        if(root.right != null)
            traversal(root.right, sum - root.val, result);
    }
}