2021-02-14（589. N叉树的前序遍历）

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
    List<Integer> res=new ArrayList<Integer>();
    public List<Integer> preorder(Node root) {
        qian(root);
        return res;
    }
    void qian(Node root){
        if(root==null){
            return;
        }
        res.add(root.val);
        for(int i=0;i<root.children.size();i++){
            qian(root.children.get(i));
        }
    }
}