使用遞歸算法結(jié)合數(shù)據(jù)庫解析成java樹形結(jié)構(gòu)

1、準(zhǔn)備表結(jié)構(gòu)及對應(yīng)的表數(shù)據(jù)
a、表結(jié)構(gòu)：

create table TB_TREE ( CID NUMBER not null, CNAME VARCHAR2(50), PID NUMBER //父節(jié)點(diǎn) )

b、表數(shù)據(jù)：

insert into tb_tree (CID, CNAME, PID) values (1, '中國', 0); insert into tb_tree (CID, CNAME, PID) values (2, '北京市', 1); insert into tb_tree (CID, CNAME, PID) values (3, '廣東省', 1); insert into tb_tree (CID, CNAME, PID) values (4, '上海市', 1); insert into tb_tree (CID, CNAME, PID) values (5, '廣州市', 3); insert into tb_tree (CID, CNAME, PID) values (6, '深圳市', 3); insert into tb_tree (CID, CNAME, PID) values (7, '海珠區(qū)', 5); insert into tb_tree (CID, CNAME, PID) values (8, '天河區(qū)', 5); insert into tb_tree (CID, CNAME, PID) values (9, '福田區(qū)', 6); insert into tb_tree (CID, CNAME, PID) values (10, '南山區(qū)', 6); insert into tb_tree (CID, CNAME, PID) values (11, '密云縣', 2); insert into tb_tree (CID, CNAME, PID) values (12, '浦東', 4);

2、TreeNode對象，對應(yīng)tb_tree

public class TreeNode implements Serializable { private Integer cid; private String cname; private Integer pid; private List nodes = new ArrayList();public TreeNode() { }//getter、setter省略 }

3、測試數(shù)據(jù)

public class TreeNodeTest { @Test public void loadTree() throws Exception{ System.out.println(JsonUtils.javaToJson(recursiveTree(1))); }/** * 遞歸算法解析成樹形結(jié)構(gòu) * * @param cid * @return * @author jiqinlin */ public TreeNode recursiveTree(int cid) { //根據(jù)cid獲取節(jié)點(diǎn)對象(SELECT * FROM tb_tree t WHERE t.cid=?) TreeNode node = personService.getreeNode(cid); //查詢cid下的所有子節(jié)點(diǎn)(SELECT * FROM tb_tree t WHERE t.pid=?) List childTreeNodes = personService.queryTreeNode(cid); //遍歷子節(jié)點(diǎn) for(TreeNode child : childTreeNodes){ TreeNode n = recursiveTree(child.getCid()); //遞歸 node.getNodes().add(n); }return node; } }

輸出的json格式如下：

{"cid": 1,"nodes": [{"cid": 2,"nodes": [{"cid": 11,"nodes": [],"cname": "密云縣","pid": 2}],"cname": "北京市","pid": 1},{"cid": 3,"nodes": [{"cid": 5,"nodes": [{"cid": 7,"nodes": [],"cname": "海珠區(qū)","pid": 5},{"cid": 8,"nodes": [],"cname": "天河區(qū)","pid": 5}],"cname": "廣州市","pid": 3},{"cid": 6,"nodes": [{"cid": 9,"nodes": [],"cname": "福田區(qū)","pid": 6},{"cid": 10,"nodes": [],"cname": "南山區(qū)","pid": 6}],"cname": "深圳市","pid": 3}],"cname": "廣東省","pid": 1},{"cid": 4,"nodes": [{"cid": 12,"nodes": [],"cname": "浦東","pid": 4}],"cname": "上海市","pid": 1}],"cname": "中國","pid": 0 }

轉(zhuǎn)載于:https://www.cnblogs.com/linjiaxin/p/6617855.html

創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎勵來咯，堅(jiān)持創(chuàng)作打卡瓜分現(xiàn)金大獎

總結(jié)

以上是生活随笔為你收集整理的使用递归算法结合数据库解析成java树形结构的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。