递归生成树形结构菜单

   
       public static List<Menu> parseMenuTree(List<Menu> list){
    List<Menu> result = new ArrayList<Menu>();
	
    // 1、获取第一级节点
    for (Menu menu : list) {
        if(null == menu.getPid()) {
	    result.add(menu);
	}	
    }
	
    // 2、递归获取子节点
    for (Menu parent : result) {
	parent = recursiveTree(parent, list);
    }
	
    return result;
}

public static Menu recursiveTree(Menu parent, List<Menu> list) {
    for (Menu menu : list) {
        if(Objects.equals(parent.getId(),menu.getPid())) {
	    menu = recursiveTree(menu, list);
	    parent.getChildren().add(menu);
	}
    }
	    
    return parent;
}