给定一个 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();
stack.push(root);
while(root !=null && !stack.empty()){
Node node = stack.pop();
if(node.children != null){
int size = node.children.size();
for(int i=size-1; i>=0; i--){
stack.push(node.children.get(i));
}
}
list.add(node.val);
}
return list;
}
}