590.N叉树的后序遍历
思路:
本题和二叉树的后序遍历大致一样,先访问 每个孩子节点,再访问 根节点,采取递归方法,找好递归的结束条件即可
代码实现
/*
// 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 {
public List<Integer> postorder(Node root) {
List<Integer> list = new LinkedList<>();
postorder(root, list);
return list;
}
public void postorder(Node root, List<Integer> list) {
if (root == null) return;
//后序遍历,先访问 每个孩子节点,再访问 根节点
for (Node node : root.children) {
postorder(node, list);
}
list.add(root.val);
}
}