java递归生成组织结构树工具类

最新推荐文章于 2023-03-09 14:30:17 发布

beidaol

最新推荐文章于 2023-03-09 14:30:17 发布

阅读量1.1k

点赞数 2

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/beidaol/article/details/107183480

本文介绍了一种使用Java递归方法来生成组织结构树的实用工具类，详细阐述了如何通过递归遍历数据并构建层次结构，帮助开发者更好地理解和处理组织结构数据。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >


public class TreeUtils {

    public static <T extends TreeNode> List<T> buildTreeNodes(List<T> listTreeNode, Long parentId) {

        List<T> distinctList = listTreeNode.stream().distinct().collect(Collectors.toList());

        List<T> listTreeNode_ = new ArrayList<>();

        for (T node : distinctList) {
            if (node.getParentId().equals(parentId)) {
                listTreeNode_.add(node);
            }
        }

        recursionMenuTree(listTreeNode, listTreeNode_);

        return listTreeNode_;
    }

    private static void recursionMenuTree(List<? extends TreeNode> listTreeNode, List<? extends TreeNode> listSubTreeNode) {
        for (TreeNode subNode : listSubTreeNode) {

            for (TreeNode node : listTreeNode) {
                if (subNode.getId().equals(node.getParentId())) {

                    if (CollectionUtils.isEmpty(subNode.getChildren())) {
                        subNode.setChildren(new ArrayList<>());
                    }

                    if (subNode.getChildren().contains(node)) {
                        continue;
                    }

                    subNode.getChildren().add(node);

                    recursionMenuTree(listTreeNode, subNode.getChildren());
                }
            }
        }
    }
}


public class TreeNode {

    protected Long id;

    @ApiModelProperty("父级节点")
    protected Long parentId;

    public List<TreeNode> children;

    public Long getId() {
        return id;
    }

    public void setId(Long id) {
        this.id = id;
    }

    public Long getParentId() {
        return parentId;
    }

    public void setParentId(Long parentId) {
        this.parentId = parentId;
    }

    public List<TreeNode> getChildren() {
        return children;
    }

    public void setChildren(List<TreeNode> children) {
        this.children = children;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;

        TreeNode treeNode = (TreeNode) o;

        return id != null ? id.equals(treeNode.id) : treeNode.id == null;
    }

    @Override
    public int hashCode() {
        return id != null ? id.hashCode() : 0;
    }
}