Java递归以及根据节点取子集合方式

 //递归树形
    private List<DeptVO> getDeptTree(List<DeptVO> childList, List<DeptVO> parentList) {
        for (DeptVO p : parentList) {
            List<DeptVO> twoLevelMenuTree = childList.stream()
                    .filter(s -> Objects.equals(s.getUpDeptId(), p.getDeptId()))
                    .collect(Collectors.toList());
            if (twoLevelMenuTree.size() > 0) {
                p.setChildren(twoLevelMenuTree);
                getDeptTree(childList, twoLevelMenuTree);
            }
        }
        return parentList;
    }

public void getChildrenByTree(DeptVO result, List<DeptVO> children, String deptId) {
        if (result == null) {
            return;
        }
        if (result.getDeptId().equals(deptId)) {
            if (result.getChildren() != null) {
                children.addAll(result.getChildren());
                return;
            }
        }
        if (result.getChildren() != null) {
            for (DeptVO child : result.getChildren()) {
                getChildrenByTree(child, children, deptId);
            }
        }
    }