首先我们知道结果应为
- 先序:1 2 4 6 7 8 3 5
- 中序:4 7 6 8 2 1 3 5
- 后序:7 8 6 4 2 5 3 1
三种遍历方法的考查顺序一致,得到的结果却不一样,原因在于:
先序:考察到一个节点后,即刻输出该节点的值,并继续遍历其左右子树。(根左右)
中序:考察到一个节点后,将其暂存,遍历完左子树后,再输出该节点的值,然后遍历右子树。(左根右)
后序:考察到一个节点后,将其暂存,遍历完左右子树后,再输出该节点的值。(左右根)
public class TreeNode {
private int value;
private TreeNode left;
private TreeNode right;
//gettersetter
}
public class binaryTreeTest {
public static void main(String[] args){
TreeNode a1 = new TreeNode(1);
TreeNode a2 = new TreeNode(2);
TreeNode a3 = new TreeNode(3);
TreeNode a4 = new TreeNode(4);
TreeNode a5 = new TreeNode(5);
TreeNode a6 = new TreeNode(6);
TreeNode a7 = new TreeNode(7);
TreeNode a8 = new TreeNode(8);
a6.setLeft(a7);
a6.setRight(a8);
a4.setRight(a6);
a2.setLeft(a4);
a1.setLeft(a2);
a1.setRight(a3);
a3.setRight(a5);
System.out.println("前序遍历");
preorderTraversal(a1);
System.out.println("\n中序遍历");
inorderTraversal(a1);
System.out.println("\n后序遍历");
postorderTraversal(a1);
}
// 前序遍历
public static void preorderTraversal (TreeNode tn){
if (tn!=null){
System.out.print(tn.getValue());
preorderTraversal(tn.getLeft());
preorderTraversal(tn.getRight());
}
}
// 中序遍历
public static void inorderTraversal(TreeNode tn){
if (tn != null) {
inorderTraversal(tn.getLeft());
System.out.print(tn.getValue());
inorderTraversal(tn.getRight());
}
}
//后序遍历
public static void postorderTraversal(TreeNode tn) {
if (tn != null) {
postorderTraversal(tn.getLeft());
postorderTraversal(tn.getRight());
System.out.print(tn.getValue());
}
}
}
这里还有非递归的解决方案
https://www.jianshu.com/p/456af5480cee