Java递归生成树

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/xqnode/article/details/79639106

直接上代码：

 @Test
    public void test1() {
        //一次性查询所有的数据库数据
        List<TCfgTsbl> dbData = tCfgTsblMapper.findAllByAy("DJ");
        //递归遍历树
        List<TCfgTsbl> tree = getTree(0L, dbData);
        System.out.println(JSON.toJSONString(tree));
    }

    //递归遍历树
    private List<TCfgTsbl> getTree(Long pId, List<TCfgTsbl> tCfgTsblList) {
        List<TCfgTsbl> tree = CollUtil.newArrayList();
        for (TCfgTsbl tCfgTsbl : tCfgTsblList) {
            if (pId.equals(tCfgTsbl.getParentId())) {
                tCfgTsbl.setChildrenList(getTree(tCfgTsbl.getId(), tCfgTsblList));
                tree.add(tCfgTsbl);
            }
        }
        return tree;
    }