java 递归遍历树形结构

 //菜单树形结构
    public JSONArray treeMenuList(JSONArray menuList, int parentId) {
        JSONArray childMenu = new JSONArray();
        for (Object object : menuList) {
            JSONObject jsonMenu = (object);
            int menuId = ("id");
            int pid = ("parentId");
            if (parentId == pid) {
                JSONArray c_node = treeMenuList(menuList, menuId);
                ("childNode", c_node);
                (jsonMenu);
            }
        }
        return childMenu;
    }

 public static void main(String args[]) {
        MenuCacheService menuCacheService = new MenuCacheService();
        JSONArray jsonArray = new JSONArray();
        Menu menu1 = new Menu();
        (1l);
        (0);
        (0);
        Menu menu2 = new Menu();
        (2l);
        (0);
        (0);
        Menu menu3 = new Menu();
        (3l);
        (2);
        (1);
        Menu menu4 = new Menu();
        (4l);
        (2);
        (1);
        Menu menu5 = new Menu();
        (5l);
        (4);
        (2);
        Menu menu6 = new Menu();
        (6l);
        (1);
        (1);

        (menu1);
        (menu2);
        (menu3);
        (menu4);
        (menu5);
        (menu6);

        ((jsonArray,0));
    }