/*
// 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<>();
public List<Integer> postorder(Node root) {
if(root!=null){
for(Node tmp:root.children){
postorder(tmp);
}
res.add(root.val);
}
return res;
}
}
N叉树的后序遍历
最新推荐文章于 2024-01-13 16:03:18 发布