Java递归查询,java递归查找树的子节点

public List<Map<String, Object>> tree() { //查询出所有的一级菜单[pid=0为一级菜单] List<Menu> treeMenu = menuServiceImpl.selectByPid(0); List<Map<String, Object>> list = new ArrayList<>(); if (treeMenu.size() > 0) { for (Menu menu : treeMenu) { Map<String, Object> map = new LinkedHashMap<>(); map.put("id", menu.getId()); map.put("name", menu.getName()); map.put("children", getChildren(menu.getId())); list.add(map); } } return list; } /** * 递归 * * @param id * @return */ public List<Object> getChildren(Integer id) { List<Object> list = new ArrayList<>(); List<Menu> treeMenu = menuServiceImpl.selectByPid(id); for (Menu menu : treeMenu) { Map<String, Object> map = new LinkedHashMap<>(); map.put("id", menu.getId()); map.put("name", menu.getName()); map.put("children", getChildren(menu.getId())); list.add(map); } return list; }