[Leetcode] 589. N叉树的前序遍历 java

给定一个 N 叉树，返回其节点值的前序遍历。

例如，给定一个 3叉树 :

 

 

返回其前序遍历: [1,3,5,6,2,4]。

一、迭代法

/*
// Definition for a Node.
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> list=new ArrayList<>();
        Stack<Node> stack=new Stack<>();
        if(root==null) return list;
        stack.push(root);
        while(!stack.isEmpty()){
            Node curr=stack.pop();
            list.add(curr.val);
            for(int i=curr.children.size()-1;i>=0;i--){
                stack.push(curr.children.get(i));
            }
        }
        return list;
    }
}

二、递归法

/*
// Definition for a Node.
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> list=new ArrayList<>();
        Stack<Node> stack=new Stack<>();
        if(root==null) return list;
        preorderTree(root,list);
        return list;
    }
    public void preorderTree(Node root,List<Integer> list){
        if(root==null) return ;
        list.add(root.val);
        if(root.children.size()>0) preorderTree(root.children.get(0),list);
        for(int i=1;i<root.children.size();i++){
            preorderTree(root.children.get(i),list);
        }
    }
}