/*
// 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> res=new ArrayList<Integer>();
public List<Integer> postorder(Node root) {
hou(root);
return res;
}
void hou(Node root){
if(root==null){
return;
}
for(int i=0;i<root.children.size();i++){
hou(root.children.get(i));
}
res.add(root.val);
}
}
2021-02-15(590. N叉树的后序遍历)
最新推荐文章于 2022-03-12 15:49:06 发布