二叉树中和为某一值的路径

public void findPath(Node node,int k){
        if(node == null) return;
        Stack<Integer> stack = new Stack<Integer>();
        findPath(node,k,stack);
    }
    public void findPath(Node root,int k,Stack<Integer> path){
        if(root == null) return ;
        if(root.left == null && root.right ==null){
            if(root.value == k){
                for(int i:path){
                    System.out.print(i+" ");
                }
                System.out.print(root.value);
            }
        }else{
            stack.push(root.value);
            finPath(root.left,k-root.value,path);
            findPath(root.right,k-root.value,path);
        }
    }