给定一个 N 叉树,返回其节点值的后序遍历。
例如,给定一个 3叉树 :
返回其后序遍历: [5,6,3,2,4,1].
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public List<Integer> postorder(Node root) {
// return postorderI(root);
// return postorderII(root);
// return postorderIII(root);
return postorderIIII(root);
}
//方法四:迭代,时间和空间复杂度O(N)
//与二叉树类似,定义prev记录上次遍历的节点
//如果该节点被访问过,不做处理;否则,将节点从右往左入栈,出栈的时就是从左到右
private List<Integer> postorderIIII(Node root) {
List<Integer> list = new ArrayList<>();
if (root == null) {
return list;
}
Stack<Node> stack = new Stack<>();
stack.push(root);
Node prev = null;
while (!stack.isEmpty()) {
Node node = stack.peek();
List<Node> children = node.children;
if (!children.isEmpty() && prev != children.get(children.size() - 1)) {
//从右往左遍历入栈
for (int i = children.size() - 1; i >= 0; i--) {
stack.push(children.get(i));
}
} else {
list.add(node.val);
prev = node;
stack.pop();
}
}
return list;
}
//方法三:迭代,与方法二类似,使用reverse函数,时间和空间复杂度O(N)
private List<Integer> postorderIII(Node root) {
List<Integer> list = new ArrayList<>();
if (root == null) {
return list;
}
Stack<Node> stack = new Stack<>();
stack.push(root);
while (!stack.isEmpty()) {
Node node = stack.pop();
list.add(node.val);
for (Node n : node.children) {
stack.push(n);
}
}
Collections.reverse(list);
return list;
}
//方法二:迭代,前序遍历反转,时间和空间复杂度O(N)
private List<Integer> postorderII(Node root) {
List<Integer> list = new ArrayList<>();
if (root == null) {
return list;
}
//后序遍历左右根,反转变成根右左,前序遍历是根左右
Stack<Node> stack = new Stack<>();
stack.push(root);
while (!stack.isEmpty()) {
Node node = stack.pop();
list.add(0, node.val);
//前序遍历是先右节点入栈,这里则是先左节点入栈
for (Node child : node.children) {
stack.push(child);
}
}
return list;
}
//方法一:递归,时间和空间复杂度O(N)
private List<Integer> postorderI(Node root) {
List<Integer> list = new ArrayList<>();
if (root == null) {
return list;
}
postOrder(root, list);
return list;
}
private void postOrder(Node root, List<Integer> list) {
if (root == null) {
return;
}
//后序遍历左右根
for (Node node : root.children) {
postOrder(node, list);
}
list.add(root.val);
}
}