使用递归将分层数据转换为arrayList。(Java)

import java.util.ArrayList;
import java.util.List;

public class RecursiveDataConverter {
    public static void main(String[] args) {
        // 示例数据
        Node root = new Node("Root");
        Node child1 = new Node("Child 1");
        Node child2 = new Node("Child 2");
        Node grandchild1 = new Node("Grandchild 1");
        Node grandchild2 = new Node("Grandchild 2");

        root.addChild(child1);
        root.addChild(child2);
        child1.addChild(grandchild1);
        child2.addChild(grandchild2);

        // 转换为ArrayList
        List<String> arrayList = convertToArrayList(root);

        // 打印结果
        for (String item : arrayList) {
            System.out.println(item);
        }
    }

    public static List<String> convertToArrayList(Node node) {
        List<String> arrayList = new ArrayList<>();
        convertToArrayListHelper(node, arrayList, 0);
        return arrayList;
    }

    private static void convertToArrayListHelper(Node node, List<String> arrayList, int level) {
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < level; i++) {
            sb.append("  "); // 每一层缩进两个空格
        }
        sb.append(node.getName());
        arrayList.add(sb.toString());

        for (Node child : node.getChildren()) {
            convertToArrayListHelper(child, arrayList, level + 1);
        }
    }
}

class Node {
    private String name;
    private List<Node> children;

    public Node(String name) {
        this.name = name;
        this.children = new ArrayList<>();
    }

    public String getName() {
        return name;
    }

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

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