#树#遍历#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 {
    public List<Integer> preorder(Node root) {
        List<Integer> iList = new LinkedList<>();
        dfs(iList,root);
        return iList;
    }
    void dfs(List<Integer> res,Node cur) {
        if(cur == null) return;
        res.add(cur.val);
        cur.children.forEach(c -> {
            dfs(res,c);
        });
    }
}