LeetCode 589
2020.8.17
我的通过代码
/*
// 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> list = new ArrayList<Integer>();
public List<Integer> preorder(Node root) {
traverse(root);
return list;
}
void traverse(Node root) {
if(root==null) return;
list.add(root.val);
if(root.children.size()>0) {
for(int i=0;i<root.children.size();i++) {
traverse(root.children.get(i));
}
}
}
}
比较容易解决。