题目:
题解:后序遍历:左 -> 右 -> 根
144. 二叉树的前序遍历
94. 二叉树的中序遍历
145. 二叉树的后序遍历
1. 题解一:递归后序遍历
第一种解决方法是使用递归。这是经典的方法,直截了当。我们可以定义一个辅助函数来实现递归。
2. 题解二:迭代后序遍历
代码:后序遍历:左 -> 右 -> 根
1. 代码一:递归后序遍历
/**
* code145
*/
import java.util.*;
public class code145 {
// 解法一:递归
public static List<Integer> postorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
postorder(root, res);
return res;
}
public static void postorder(TreeNode root, List<Integer> res) {
if (root == null) {
return;
}
postorder(root.left, res);
postorder(root.right, res);
res.add(root.val);
}
public static void main(String[] args) {
// 根据给定的数组创建一棵树
Integer nums[] = { 1, null, 2, 3 };
TreeNode tree = ConstructTree.constructTree(nums);
// 将刚刚创建的树打印出来
TreeOperation.show(tree);
// Integer nums[] = { 5, 4, 8, 11, null, 13, 4, 7, 2, null, null, null, 1 };
// TreeNode tree = ConstructTree.constructTree(nums);
// ConstructTree.postorder(tree);
// System.out.println();
// ConstructTree.midOrder(tree);
// System.out.println();
// ConstructTree.aftOrder(tree);
// System.out.println();
// TreeOperation.show(tree);
System.out.println("后序遍历:");
List<Integer> list = postorderTraversal(tree);
for (int i = 0; i < list.size(); i++) {
System.out.print(list.get(i) + " ");
}
System.out.println();
}
}
2. 代码二:迭代后序遍历
/**
* code145
*/
import java.util.*;
public class code145 {
// 解法二:迭代
public static List<Integer> postorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();
TreeNode cur = root;
TreeNode last = null;
while (cur != null || !stack.isEmpty()) {
while (cur != null) {
stack.push(cur);
cur = cur.left;
}
cur = stack.peek();
if(cur.right == null || cur.right == last)
{
res.add(cur.val);
stack.pop();
// 记录上一个访问的节点
// 用于判断“访问根节点之前,右子树是否已访问过”
last = cur;
// 表示不需要转向,继续弹栈
cur = null;
}
else
{
cur = cur.right;
}
}
return res;
}
public static void main(String[] args) {
// 根据给定的数组创建一棵树
Integer nums[] = { 1, null, 2, 3 };
TreeNode tree = ConstructTree.constructTree(nums);
// 将刚刚创建的树打印出来
TreeOperation.show(tree);
// Integer nums[] = { 5, 4, 8, 11, null, 13, 4, 7, 2, null, null, null, 1 };
// TreeNode tree = ConstructTree.constructTree(nums);
// ConstructTree.postorder(tree);
// System.out.println();
// ConstructTree.midOrder(tree);
// System.out.println();
// ConstructTree.aftOrder(tree);
// System.out.println();
// TreeOperation.show(tree);
System.out.println("后序遍历:");
List<Integer> list = postorderTraversal(tree);
for (int i = 0; i < list.size(); i++) {
System.out.print(list.get(i) + " ");
}
System.out.println();
}
}