JAVA递归查询根据当前节点查询所有子节点

coloful_world

已于 2023-07-06 15:10:26 修改

阅读量4.3k

点赞数 2

文章标签： java 开发语言

于 2022-07-07 10:44:20 首次发布

本文链接：https://blog.csdn.net/weixin_41632551/article/details/125654146

版权

	public List<School> menuList = new ArrayList<School>();//初始化数据

    public  List<Integer> childMenu=new ArrayList<>();//全局变量
    @Test
    public void test11(){
        menuList.add(new School(1,"张三丰",0));
        menuList.add(new School(2,"张无忌",1));
        menuList.add(new School(3,"张翠山",2));
        menuList.add(new School(4,"殷梨亭",3));
        menuList.add(new School(5,"俞莲舟",3));
        menuList.add(new School(6,"宋远桥",4));
        menuList.add(new School(7,"宋远桥",5));
        treeMenuList(menuList,1);
        System.out.println(childMenu);
    }
    //递归查询所有子节点
    public  List<Integer> treeMenuList(List<School> menuList, Integer myId){
        for(School mu: menuList){
            //遍历出父id等于参数的id，add进子节点集合
            if(mu.getPid()==myId){
                //递归遍历下一级
                childMenu.add(mu.getId());
                treeMenuList(menuList,mu.getId());
            }
        }
        return childMenu;
    }