java递归查询省市区树形结构

具体代码实现以下：

@RequestMapping("getTree") public Map<String, Object> getTree(int id) { Map<String, Object> map = new HashMap<>(); try { ChinaCitys province = dao.findProvince(id); //查询出一个省
            if (province != null) { List<ChinaCitys> citys = dao.findChildren(province.getId());//查询省下面的全部市
                digui(citys); //调用递归算法查询市如下的区县
 province.setChildren(citys); } map.put("data", province); } catch (Exception e) { e.printStackTrace(); } return map; } public void digui(List<ChinaCitys> citys) { List<ChinaCitys> retList = new ArrayList<>(); for (ChinaCitys c : citys) { retList = dao.findChildren(c.getId()); if (retList.size() > 0) { c.setChildren(retList); digui(retList); //循环调用本身
 } } }

sql语句：

<select id="findProvince" parameterType="java.lang.Integer" resultMap="BaseResultMap">
             select id,name from china_citys WHERE id = #{id} </select>

    <select id="findChildren" parameterType="java.lang.Integer" resultMap="BaseResultMap">
        select id,name  from china_citys WHERE upid = #{id} </select>