递归版本
/*
// 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 {
List<Integer> result = new LinkedList();
public List<Integer> preorder(Node root) {
if(root==null)
return result;
result.add(root.val);
for(Iterator iter=root.children.iterator(); iter.hasNext();) {
preorder((Node) iter.next());
}
return result;
}
}
非递归版本
/*
// 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<>();
if (root == null) return list;
Stack<Node> stack = new Stack<>();
stack.add(root);
while (!stack.empty()) {
root = stack.pop();
list.add(root.val);
if (root.children != null) {
for (int i = root.children.size() - 1; i >= 0; i--)
stack.add(root.children.get(i));
}
}
return list;
}
}