给定一个 N 叉树,返回其节点值的后序遍历。
例如,给定一个 3叉树 :
思路:
dfs
题解(迭代法后续补上):
返回其后序遍历: [5,6,3,2,4,1].
/*
// 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 {
ArrayList result=new ArrayList();
public List<Integer> postorder(Node root) {
if(root==null) return result;
for(Node n: root.children){
postorder(n);
}
result.add(root.val);
return result;
}
}