将List转成树的两种方式(递归、循环)

在做目录树的时候通常是将一个目录存在数据库的List全部返回来，再根据节点id和parentId组装成一颗树。这里切忌使用递归查询数据库的方式实现，应把对应的目录数据全部查询回来再进行组装。List转成Tree有两种方式，一种是常用的递归，一种是双层循环。

TreeNode.java

1. package org.massive.tree;
3. import java.util.List;
5. /**
6. * Created by Massive on 2016/12/26.
7. */
8. public class TreeNode {
10. private String id;
12. private String parentId;
14. private String name;
16. private List<TreeNode> children;
18. public TreeNode(String id, String name, String parentId) {
19. this.id = id;
20. this.parentId = parentId;
21. this.name = name;
22. }
23. public TreeNode(String id, String name, TreeNode parent) {
24. this.id = id;
25. this.parentId = parent.getId();
26. this.name = name;
27. }
30. public String getParentId() {
31. return parentId;
32. }
34. public void setParentId(String parentId) {
35. this.parentId = parentId;
36. }
38. public String getName() {
39. return name;
40. }
42. public void setName(String name) {
43. this.name = name;
44. }
46. public String getId() {
47. return id;
48. }
50. public void setId(String id) {
51. this.id = id;
52. }
54. public List<TreeNode> getChildren() {
55. return children;
56. }
58. public void setChildren(List<TreeNode> children) {
59. this.children = children;
60. }
62. @Override
63. public String toString() {
64. return "TreeNode{" +
65. "id='" + id + '\'' +
66. ", parentId='" + parentId + '\'' +
67. ", name='" + name + '\'' +
68. ", children=" + children +
69. '}';
70. }
72. }

TreeBuilder.java

1. package org.massive.tree;
3. import java.util.ArrayList;
4. import java.util.List;
6. /**
7. * Created by Massive on 2016/12/26.
8. */
9. public class TreeBuilder {
11. /**
12. * 两层循环实现建树
13. * @param treeNodes 传入的树节点列表
14. * @return
15. */
16. public static List<TreeNode> bulid(List<TreeNode> treeNodes) {
18. List<TreeNode> trees = new ArrayList<TreeNode>();
20. for (TreeNode treeNode : treeNodes) {
22. if ( "0".equals(treeNode.getParentId())) {
23. trees.add(treeNode);
24. }
26. for (TreeNode it : treeNodes) {
27. if (it.getParentId() == treeNode.getId()) {
28. if (treeNode.getChildren() == null) {
29. treeNode.setChildren( new ArrayList<TreeNode>());
30. }
31. treeNode.getChildren().add(it);
32. }
33. }
34. }
35. return trees;
36. }
38. /**
39. * 使用递归方法建树
40. * @param treeNodes
41. * @return
42. */
43. public static List<TreeNode> buildByRecursive(List<TreeNode> treeNodes) {
44. List<TreeNode> trees = new ArrayList<TreeNode>();
45. for (TreeNode treeNode : treeNodes) {
46. if ( "0".equals(treeNode.getParentId())) {
47. trees.add(findChildren(treeNode,treeNodes));
48. }
49. }
50. return trees;
51. }
53. /**
54. * 递归查找子节点
55. * @param treeNodes
56. * @return
57. */
58. public static TreeNode findChildren(TreeNode treeNode,List<TreeNode> treeNodes) {
59. for (TreeNode it : treeNodes) {
60. if(treeNode.getId().equals(it.getParentId())) {
61. if (treeNode.getChildren() == null) {
62. treeNode.setChildren( new ArrayList<TreeNode>());
63. }
64. treeNode.getChildren().add(findChildren(it,treeNodes));
65. }
66. }
67. return treeNode;
68. }
72. public static void main(String[] args) {
74. TreeNode treeNode1 = new TreeNode( "1", "广州", "0");
75. TreeNode treeNode2 = new TreeNode( "2", "深圳", "0");
77. TreeNode treeNode3 = new TreeNode( "3", "天河区",treeNode1);
78. TreeNode treeNode4 = new TreeNode( "4", "越秀区",treeNode1);
79. TreeNode treeNode5 = new TreeNode( "5", "黄埔区",treeNode1);
80. TreeNode treeNode6 = new TreeNode( "6", "石牌",treeNode3);
81. TreeNode treeNode7 = new TreeNode( "7", "百脑汇",treeNode6);
84. TreeNode treeNode8 = new TreeNode( "8", "南山区",treeNode2);
85. TreeNode treeNode9 = new TreeNode( "9", "宝安区",treeNode2);
86. TreeNode treeNode10 = new TreeNode( "10", "科技园",treeNode8);
89. List<TreeNode> list = new ArrayList<TreeNode>();
91. list.add(treeNode1);
92. list.add(treeNode2);
93. list.add(treeNode3);
94. list.add(treeNode4);
95. list.add(treeNode5);
96. list.add(treeNode6);
97. list.add(treeNode7);
98. list.add(treeNode8);
99. list.add(treeNode9);
100. list.add(treeNode10);
102. List<TreeNode> trees = TreeBuilder.bulid(list);
104. List<TreeNode> trees_ = TreeBuilder.buildByRecursive(list);
106. }
108. }