递归查询子节点，组装树形结构返回-案例

package com.sdss.sk;

import lombok.Data;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
@Data
class User {
    private int id;
    private int parentId;
    private String name;

    public User(int id, int parentId, String name) {
        this.id = id;
        this.parentId = parentId;
        this.name = name;
    }

    public int getId() {
        return id;
    }

    public int getParentId() {
        return parentId;
    }

    public String getName() {
        return name;
    }
}
@Data
class TreeNode {
    private User user;
    private List<TreeNode> children;

    public TreeNode(User user) {
        this.user = user;
        this.children = new ArrayList<>();
    }

    public User getUser() {
        return user;
    }

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

    public void addChild(TreeNode child) {
        children.add(child);
    }
}

public class TreeBuilder {
    public static List<TreeNode> buildTree(List<User> users, int rootParentId) {
        Map<Integer, TreeNode> nodeMap = new HashMap<>();
        for (User user : users) {
            TreeNode node = new TreeNode(user);
            nodeMap.put(user.getId(), node);
        }

        List<TreeNode> roots = new ArrayList<>();
        for (User user : users) {
            TreeNode node = nodeMap.get(user.getId());
            if (node.getUser().getId() == rootParentId){
                roots.add(node);
            }else {
                if (node.getUser().getParentId() == rootParentId) {
                   // roots.add(node);
                    TreeNode parent = nodeMap.get(user.getParentId());
                    if (parent != null) {
                        parent.addChild(node);
                    }
                } else {
                    TreeNode parent = nodeMap.get(user.getParentId());
                    if (parent != null) {
                        parent.addChild(node);
                    }
                }
            }

        }

        return roots;
    }

    public static void main(String[] args) {
        List<User> users = new ArrayList<>();
        users.add(new User(1, 0, "User 1"));
        users.add(new User(2, 1, "User 2"));
        users.add(new User(3, 1, "User 3"));
        users.add(new User(4, 2, "User 4"));
        users.add(new User(5, 3, "User 5"));
        users.add(new User(6, 0, "User 6")); // Another root node

        List<TreeNode> roots = buildTree(users, 1);
        System.out.println("roots = " + roots);
        for (TreeNode root : roots) {
            printTree(root, 0);
        }
    }

    private static void printTree(TreeNode node, int depth) {
        for (int i = 0; i < depth; i++) {
            System.out.print("  ");
        }
        System.out.println(node.getUser().getName());
        for (TreeNode child : node.getChildren()) {
            printTree(child, depth + 1);
        }
    }
}