LeetCode_113 Path Sum II

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

For example:
Given the below binary tree and sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
return
[
[5,4,11,2],
[5,8,4,5]
]

    List<List<Integer>> res = new ArrayList<List<Integer>>();
    List<Integer> path = new ArrayList<Integer>();
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        if(root == null) return res;
        getPath(root, sum, 0);
        return res;

    }
    private void getPath(TreeNode root, int sum,int curSum){
        if(root == null) return ;
        curSum +=root.val;
        path.add(root.val);
        if (root.left == null&& root.right ==null && sum == curSum) {
            res.add(new ArrayList<Integer>(path));
        }
        getPath(root.left, sum, curSum);
        getPath(root.right, sum, curSum);

        curSum -=root.val;
        path.remove(path.size()-1);

    }