树在java中的应用,利用递归创建树,在java中的应用

public class SspOrgTreeBean {
    /**   
     * @Fields serialVersionUID: TODO
     */ 
    private static final long serialVersionUID = 1L;
    private String id;
    private String text;
    private List<SspOrgTreeBean> children = null;
    /**
     * 子代机构数
     */
    private Integer childrenSize;
    public String getId() {
        return id;
    }
    public void setId(String id) {
        this.id = id;
    }
    public String getText() {
        return text;
    }
    public void setText(String text) {
        this.text = text;
    }
    public List<SspOrgTreeBean> getChildren() {
        return children;
    }
    public void setChildren(List<SspOrgTreeBean> children) {
        this.children = children;
    }

    public Integer getChildrenSize() {
        return childrenSize;
    }

    public void setChildrenSize(Integer childrenSize) {
        this.childrenSize = childrenSize;
    }
}
public SspOrgTreeBean getOrgTree(
        SspFrontRpcRequest<SspSystemOrganizationRpcBean> request) {
    logger.info("机构树查询条件{}",request.getObject());
    long start = System.currentTimeMillis();
    Organization searchOrg = new Organization();
    searchOrg.setOrgUuid(request.getObject().getCurrentOrgNo());
    Organization rootOrg = orgService.queryOrgByOrgUuid(searchOrg);
    if(null != rootOrg){
        SspOrgTreeBean tree = new SspOrgTreeBean();
        tree.setId(rootOrg.getOrgUuid());
        listOrgUuid.add(rootOrg.getOrgUuid());
        tree.setText(rootOrg.getOrgNm());
        tree.setChildren(findChildren(rootOrg,orgService.queryOrgByParentOrgUuid(rootOrg),request.getObject().isDirectly()));
        long end = System.currentTimeMillis();
        logger.info("机构树查询成功,查询结果:{}ms",(end-start));
        return tree;
    }
    return null;
}

 

/**
 * 查询子机构列表
 * 
 * @param org
 * @param children
 * @param directly 为true会多出一个直属节点,false就是所有节点
 * @return
 */
private List<SspOrgTreeBean> findChildren(Organization org, List<Organization> children, boolean directly) {
    if (directly) {
        List<SspOrgTreeBean> treeList = new  ArrayList<>();
        SspOrgTreeBean treeBean = new SspOrgTreeBean();
        treeBean.setId(org.getOrgUuid()+"_noall");
        treeBean.setText(org.getOrgNm()+"(直属)");
        List<SspOrgTreeBean> childList = new  ArrayList<>();
     listOrgUuid.add(org.getOrgUuid());
     if(null != children && children.size() > 0){
            for(Organization childOrg : children){
                SspOrgTreeBean childBean = new SspOrgTreeBean();
                childBean.setId(childOrg.getOrgUuid());
                childBean.setText(childOrg.getOrgNm());
             childBean.setChildren(findChildren(childOrg,orgService.queryOrgByParentOrgUuid(childOrg),directly));
                childList.add(childBean);
            }
        }
        treeList.add(treeBean);
        treeList.addAll(childList);
        return treeList;
    } else {
        List<SspOrgTreeBean> childList = new  ArrayList<>();
        for(Organization childOrg : children){
            SspOrgTreeBean childBean = new SspOrgTreeBean();
            childBean.setId(childOrg.getOrgUuid());
            childBean.setText(childOrg.getOrgNm());
            childBean.setChildren(findChildren(childOrg,orgService.queryOrgByParentOrgUuid(childOrg),directly));
            childList.add(childBean);
        }
        return childList;
    }

}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值