Java 根据id、pid生成树状结构

package com.cnmyhr.base.entity;

import lombok.Data;

import java.io.Serializable;
import java.util.ArrayList;
import java.util.List;

/**
 * @Description 树节点、所有需要实现树节点的，都需要继承该类
 * @Author Hsz
 * @Date 2023/4/23 16:58
 * @Version 1.0
 **/
@Data
public class TreeNode<T> implements Serializable {

    private static final long serialVersionUID = 1L;
    /**
     * 主键
     */
    private Long id;
    /**
     * 上级ID
     */
    private Long parentId;
    /**
     * 子节点列表
     */
    private List<T> children = new ArrayList<>();

}

package com.cnmyhr.base.util;


import com.cnmyhr.base.entity.TreeNode;
import org.springframework.util.Assert;

import java.util.*;

/**
 * @Description 树形结构工具类
 * @Author Hsz
 * @Date 2023/4/23 16:17
 * @Version 1.0
 **/
public class TreeUtil {

    /**
     * 根据pid，构建树节点
     */
    public static <T extends TreeNode> List<T> build(List<T> treeNodes, Long pid) {
        //pid不能为空
        Assert.notNull(pid,"节点错误！");
        List<T> treeList = new ArrayList<>();
        for(T treeNode : treeNodes) {
            if (pid.equals(treeNode.getParentId())) {
                treeList.add(findChildren(treeNodes, treeNode));
            }
        }

        return treeList;
    }

    /**
     * 查找子节点
     */
    private static <T extends TreeNode> T findChildren(List<T> treeNodes, T rootNode) {
        for(T treeNode : treeNodes) {
            if(rootNode.getId().equals(treeNode.getParentId())) {
                rootNode.getChildren().add(findChildren(treeNodes, treeNode));
            }
        }
        return rootNode;
    }

    /**
     * 构建树节点
     */
    public static <T extends TreeNode> List<T> build(List<T> treeNodes) {
        List<T> result = new ArrayList<>();

        //list转map
        Map<Long, T> nodeMap = new LinkedHashMap<>(treeNodes.size());
        for(T treeNode : treeNodes){
            nodeMap.put(treeNode.getId(), treeNode);
        }

        for(T node : nodeMap.values()) {
            T parent = nodeMap.get(node.getParentId());
            if(parent != null && !(node.getId().equals(parent.getId()))){
                parent.getChildren().add(node);
                continue;
            }
            result.add(node);
        }

        return result;
    }





}