生成树

树的实体类以及操作方法

public class DimTreeContent {
    private    String nodeId;
    private String nodeName;  
    private DimTreeContent parentNode;  
    private List<DimTreeContent> childList;  
  
    public DimTreeContent() {
        initChildList();  
    }    
    
    public void addChildNode(DimTreeContent treeNode) {  
        initChildList();  
        childList.add(treeNode);  
    }  
  /**
   * 插入节点
   */
    public void initChildList() {  
        if (childList == null)  
            childList = new ArrayList<DimTreeContent>();  
    }      
    /**
     * 查找节点
     * @param id
     * @return
     */
    public DimTreeContent findTreeNodeById(String id) {  
        if (this.nodeId == id)  
            return this;  
        if (childList.isEmpty() || childList == null) {  
            return null;  
        } else {  
            int childNumber = childList.size();  
            for (int i = 0; i < childNumber; i++) {  
                DimTreeContent child = childList.get(i);  
                DimTreeContent resultNode = child.findTreeNodeById(id);  
                if (resultNode != null) {  
                    return resultNode;  
                }  
            }  
            return null;  
        }  
    }
    //深度遍历
    public static List<String> listmaps = new ArrayList<String>();
    public void traverse() {
        if ("".equals(nodeId) || nodeId == null)
            return;
        if (childList == null || childList.isEmpty()){
            listmaps.add(this.nodeId);
            return;
        }
        for (int i = 0; i < childList.size(); i++) {
            DimTreeContent child = childList.get(i);
            child.traverse();
        }
    }
    
    public List<List<Map<String,String>>> getDimContent(){
        List<List<Map<String,String>>> listList = new ArrayList<List<Map<String,String>>>(); 
        for(int i = 0; i < listmaps.size(); i++){
            List<Map<String,String>> list = new ArrayList<Map<String,String>>(); 
            DimTreeContent dimContent = findTreeNodeById(listmaps.get(i));
            Map<String,String> map = new HashMap<String,String>();
            map.put(dimContent.nodeId, dimContent.nodeName);
            list.add(map);
            while(dimContent.getParentNode().nodeId != "rootid"){
                dimContent = dimContent.getParentNode();
                Map<String,String> m = new HashMap<String,String>();
                m.put(dimContent.nodeId, dimContent.nodeName);
                list.add(m);
            }
            listList.add(list);
        }
        
        return listList;
    }
    
    public String getNodeId() {
        return nodeId;
    }

    public void setNodeId(String nodeId) {
        this.nodeId = nodeId;
    }

    public String getNodeName() {
        return nodeName;
    }

    public void setNodeName(String nodeName) {
        this.nodeName = nodeName;
    }

    public DimTreeContent getParentNode() {
        return parentNode;
    }

    public void setParentNode(DimTreeContent parentNode) {
        this.parentNode = parentNode;
    }

    public List<DimTreeContent> getChildList() {
        return childList;
    }

    public void setChildList(List<DimTreeContent> childList) {
        this.childList = childList;
    }  
    
    
}

生成树使用了栈加树实现的生成。

 

转载于:https://www.cnblogs.com/yuxin299/p/6894262.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值