有父子关系的集合转换为树结构 递归创建、查找树

一、工具类

@UtilityClass
public class TreeUtil {
   

    /**
     * 两层循环实现建树
     *
     * @param treeNodes 传入的树节点列表
     * @return
     */
    public <T extends TreeNode> List<T> build(List<T> treeNodes, Object root) {
   

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

        for (T treeNode : treeNodes) {
   

            if (root.equals(treeNode.getParentId())) {
   
                trees.add(treeNode);
            }

            for (T it : treeNodes) {
   
                if (it.getParentId() == treeNode.getId()) {
   
                    if (treeNode.getChildren() == null) {
   
                        treeNode.setChildren(new ArrayList<>());
                    }
                    treeNode.add(it);
                }
            }
        }
        return trees;
    }

    /**
     * 使用递归方法建树
     *
     * @param treeNodes
     * @return
     */
    public <T extends TreeNode> List<T> buildByRecursive(List<T> treeNodes, Object root) {
   
        List<T> trees = new ArrayList<T>();
        for (T treeNode : treeNodes) {
   
            if (root.equals(treeNode.getParentId())) {
   
                trees.add(findChildren(treeNode, treeNodes));
            }
        }
        return trees;
    }

    /**
     * 递归查找子节点
     *
     * @param treeNodes
     * @return
     */
    public <T extends TreeNode> T findChildren(T treeNode, List<T> treeNodes) {
   
        for (T it : treeNodes) {
   
            if (treeNode.getId() == it.getParentId()) {
   
                if (treeNode.getChildren() == null) {
   
                    treeNode.setChildren(new ArrayList<>());
                }
                treeNode.add