java树的类_个人常用工具类：JAVA树形结构工具类02

JAVA树形结构工具类02

TreeNode

import java.util.ArrayList;

import java.util.List;

/**

* Created by Ace on 2017/6/12.

*/

public class TreeNode {

protected int id;

protected int parentId;

List children = new ArrayList();

public List getChildren() {

return children;

}

public void setChildren(List children) {

this.children = children;

}

public int getId() {

return id;

}

public void setId(int id) {

this.id = id;

}

public int getParentId() {

return parentId;

}

public void setParentId(int parentId) {

this.parentId = parentId;

}

public void add(TreeNode node){

children.add(node);

}

}

TreeUtil

import java.util.ArrayList;

import java.util.List;

/**

* Created by Ace on 2017/6/12.

*/

public class TreeUtil{

/**

* 两层循环实现建树

*

* @param treeNodes 传入的树节点列表

* @return

*/

public static List bulid(List treeNodes,Object root) {

List trees = new ArrayList();

for (T treeNode : treeNodes) {

if (root.equals(treeNode.getParentId())) {

trees.add(treeNode);

}

for (T it : treeNodes) {

if (it.getParentId() == treeNode.getId()) {

if (treeNode.getChildren() == null) {

treeNode.setChildren(new ArrayList());

}

treeNode.add(it);

}

}

}

return trees;

}

/**

* 使用递归方法建树

*

* @param treeNodes

* @return

*/

public static List buildByRecursive(List treeNodes,Object root) {

List trees = new ArrayList();

for (T treeNode : treeNodes) {

if (root.equals(treeNode.getParentId())) {

trees.add(findChildren(treeNode, treeNodes));

}

}

return trees;

}

/**

* 递归查找子节点

*

* @param treeNodes

* @return

*/

public static T findChildren(T treeNode, List treeNodes) {

for (T it : treeNodes) {

if (treeNode.getId() == it.getParentId()) {

if (treeNode.getChildren() == null) {

treeNode.setChildren(new ArrayList());

}

treeNode.add(findChildren(it, treeNodes));

}

}

return treeNode;

}

}