递归法
class Node {
public int val;
public List<Node> children;
public Node() {}
public Node(int _val,List<Node> _children) {
val = _val;
children = _children;
}
}
class Solution {
public List<Integer> preorder(Node root) {
List<Integer> integers=new ArrayList<>();
tansuo(integers,root);
return integers;
}
public void tansuo(List<Integer> integers,Node root){
if (root==null){
return;
}
integers.add(root.val);
for (int i = 0; i < root.children.size(); i++) {
tansuo(integers,root.children.get(i));
}
}
}