java 递归查询所有子节点id的方法实现

public class Node {
    private int id;
    private int parentId;
    private List<Node> children;

    // 构造函数、Getter和Setter省略
}

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

public class TreeUtils {

    /**
     * 递归查询一个节点下的所有子节点ID
     * @param rootNode 起始节点
     * @return 所有子节点的ID列表
     */
    public static List<Integer> findAllChildNodeIds(Node rootNode) {
        List<Integer> childNodeIds = new ArrayList<>();
        addAllChildNodeIds(rootNode, childNodeIds);
        return childNodeIds;
    }

    private static void addAllChildNodeIds(Node node, List<Integer> childNodeIds) {
        if (node == null) {
            return;
        }
        List<Node> children = node.getChildren();
        if (children != null) {
            for (Node child : children) {
                childNodeIds.add(child.getId());
                addAllChildNodeIds(child, childNodeIds); // 递归调用
            }
        }
    }
}

public class Main {
    public static void main(String[] args) {
        // 构造节点关系
        Node root = new Node();
        root.setId(1);
        
        Node child1 = new Node();
        child1.setId(2);
        
        Node child2 = new Node();
        child2.setId(3);
        
        root.setChildren(Arrays.asList(child1, child2));
        
        // 查询所有子节点ID
        List<Integer> allChildNodeIds = TreeUtils.findAllChildNodeIds(root);
        
        // 输出结果
        System.out.println("All Child Node IDs: " + allChildNodeIds);
    }
}