难度:简单
给定一个 n 叉树的根节点
root
,返回 其节点值的 后序遍历 。n 叉树 在输入中按层序遍历进行序列化表示,每组子节点由空值
null
分隔(请参见示例)。示例 1:
输入:root = [1,null,3,2,4,null,5,6] 输出:[5,6,3,2,4,1]示例 2:
输入:root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14] 输出:[2,6,14,11,7,3,12,8,4,13,9,10,5,1]提示:
- 节点总数在范围
[0, 104]
内0 <= Node.val <= 104
- n 叉树的高度小于或等于
1000
进阶:递归法很简单,你可以使用迭代法完成此题吗?
代码:
递归法:
/*
// 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) {
if (root == null) {
return new ArrayList<>();
}
//后序是左右根
List<Integer> res = new ArrayList<>();
search(root, res);
return res;
}
private void search(Node root, List<Integer> list) {
if (root.children != null) {
for (Node node : root.children) {
search(node, list);
}
}
list.add(root.val);
}
}
迭代法:
/*
// 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> res = new ArrayList<>();
if (root == null) {
return res;
}
Deque<Node> stack = new ArrayDeque<>();
Set<Node> visited = new HashSet<>();
//根节点入栈
stack.push(root);
while (!stack.isEmpty()) {
//获取栈顶元素
Node curr = stack.peek();
//如果当前节点没有子节点或者子节点已经全部入栈
if (curr.children == null || visited.contains(curr)) {
//当前节点出栈
stack.pop();
res.add(curr.val);
} else {
//将该节点的子节点全部入栈
for (int i = curr.children.size() - 1; i >= 0; i--) {
stack.push(curr.children.get(i));
}
//标记该节点的子节点已经全部入栈
visited.add(curr);
}
}
return res;
}
}