java 通用树_一个树型通用接口

importorg.apache.commons.lang3.StringUtils;import java.util.*;/*** 把一个list集合,里面的bean含有 parentId 转为树形式

**/

public classTreeUtil {/*** 判断两个父ID是否相同

*@paramp1

*@paramp2

*@return

*/

private booleanisEqualsParentId(Object p1,Object p2){if(p1!=null && p1!=null){returnp1.equals(p2);

}else if(p1==null && p2 == null) {return true;

}else if(p1==null && p2 != null) {if("".equals(p2.toString())){return true;

}else{return false;

}

}else if(p1!=null && p2 == null) {if("".equals(p1.toString())){return true;

}else{return false;

}

}else{return false;

}

}/*** 根据父节点的ID获取所有子节点，该方法顶级节点必须为空

*@paramlist 分类表

*@paramparentId 传入的父节点ID

*@returnString*/

public List getChildTreeObjects(Listlist,Object parentId) {

List returnList= newArrayList();if(list!=null&&list.size()>0) {for (Iterator iterator =list.iterator(); iterator.hasNext(); ) {

TreeObject t=(TreeObject) iterator.next();//一、根据传入的某个父节点ID,遍历该父节点的所有子节点

if(isEqualsParentId(t.getParentId(), parentId)) {

recursionFn(list, t);

returnList.add(t);

}

}

}returnreturnList;

}/*** 根据父节点的ID获取所有子节点，该方法顶级节点可以不为空,非树直接返回

*@paramlist 分类表

*@returnString*/

public List getChildTreeObjects(Listlist) {if(list!=null&&list.size()>0) {

List topList=new ArrayList<>();

List subList=new ArrayList<>();

Map idMap=new HashMap<>();for (Iterator iterator =list.iterator(); iterator.hasNext(); ) {//归并所有list的id集合

TreeObject t =(TreeObject) iterator.next();

idMap.put(t.getId().toString(), t.getId().toString());

}for (Iterator iterator =list.iterator(); iterator.hasNext(); ) {//获取最顶级的list

TreeObject t =(TreeObject) iterator.next();if(t.getParentId()==null||StringUtils.isEmpty(t.getParentId().toString())){

topList.add(t);

}else{

String id=idMap.get(t.getParentId().toString());if(StringUtils.isEmpty(id)){

topList.add(t);

}else{

subList.add(t);

}

}

}if(topList!=null&&topList.size()>0&&subList!=null&&subList.size()>0){

List resultList=new ArrayList<>();for(TreeObject t:topList) {//将儿子级别的list归并到顶级中

List subOneList=new ArrayList<>();for(TreeObject sub:subList) {//一、根据传入的某个父节点ID,遍历该父节点的所有子节点

if(isEqualsParentId(sub.getParentId(), t.getId())) {

recursionFn(subList, sub);

subOneList.add(sub);

}

}

t.setChildren(subOneList);

resultList.add(t);

}returnresultList;

}else{returnlist;

}

}returnlist;

}/*** 递归列表*@paramlist

*@paramt*/

private void recursionFn(Listlist, TreeObject t) {

List childList = getChildList(list, t);//得到子节点列表

t.setChildren(childList);for(TreeObject tChild : childList) {if (hasChild(list, tChild)) {//判断是否有子节点//returnList.add(TreeObject);

Iterator it =childList.iterator();while(it.hasNext()) {

TreeObject n=(TreeObject) it.next();

recursionFn(list, n);

}

}

}

}//得到子节点列表

private List getChildList(Listlist, TreeObject t) {

List tlist = new ArrayList();

Iterator it =list.iterator();while(it.hasNext()) {

TreeObject n=(TreeObject) it.next();if(isEqualsParentId(n.getParentId(),t.getId())) {

tlist.add(n);

}

}returntlist;

}

List returnList = new ArrayList();/*** 根据父节点的ID获取所有子节点

*@paramlist 分类表

*@paramparentId 传入的父节点ID

*@paramprefix 子节点前缀*/

public List getChildTreeObjects(Listlist, Object parentId,String prefix){if(list == null) return null;for (Iterator iterator =list.iterator(); iterator.hasNext();) {

TreeObject node=(TreeObject) iterator.next();//一、根据传入的某个父节点ID,遍历该父节点的所有子节点

if(isEqualsParentId(node.getParentId(),parentId)) {

recursionFn(list, node,prefix);

}//二、遍历所有的父节点下的所有子节点

/*if (node.getParentId()==0) {

recursionFn(list, node);

}*/}returnreturnList;

}private void recursionFn(Listlist, TreeObject node,String p) {

List childList = getChildList(list, node);//得到子节点列表

if (hasChild(list, node)) {//判断是否有子节点

returnList.add(node);

Iterator it =childList.iterator();while(it.hasNext()) {

TreeObject n=(TreeObject) it.next();

n.setName(p+n.getName());

recursionFn(list, n,p+p);

}

}else{

returnList.add(node);

}

}//判断是否有子节点

private boolean hasChild(Listlist, TreeObject t) {return getChildList(list, t).size() > 0 ? true : false;

}

}