Leetcode Path sum I, II

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.

[code]

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

get all paths

public class Solution {
    List<List<Integer>> list;
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        list= new ArrayList<List<Integer>>();
        ArrayList<Integer> way=new ArrayList<Integer>();
        path(root, sum, way);
        return list;
    }

    void path(TreeNode node, int sum, ArrayList<Integer> way)
    {
        if(node==null)return;
        way.add(node.val);
        if(node.left==null && node.right==null && sum==node.val)
        {
            list.add(new ArrayList<Integer>(way));
        }
        path(node.left, sum-node.val, way);
        path(node.right, sum-node.val, way);
        way.remove(way.size()-1);
    }
}