目的:分别打印二叉树- 前序排序、中序排序、后序排序结果
public static class Node {
Node left;
Node right;
int value;
public Node(int value) {
this.value = value;
}
}
首先了解一下前序排序、中序排序、后序排序是怎样的
前序排序:对于每个节点都要满足,先打印节点,再打印左树,再打印右树
中序排序:对于每个节点都要满足,先打印左树,再打印节点,再打印右树
后序排序:对于每个节点都要满足,先再打印左树,再打印右树,再打印节点
像下面这颗二叉树
前序排序:3-2-4-1-2-5
中序排序:4-2-1-3-2-5
后序排序:4-1-2-5-2-3
代码也很简单,用递归方法,将上面规则翻译就行了,如下:
public static class Node {
Node left;
Node right;
int value;
public Node(int value) {
this.value = value;
}
}
//前序排序
public static void pre(Node node) {
if (node == null) {
return;
}
System.out.print(node.value+" ");
pre(node.left);
pre(node.right);
}
//中序排序
public static void in(Node node) {
if (node == null) {
return;
}
in(node.left);
System.out.print(node.value+" ");
in(node.right);
}
//后序排序
public static void pos(Node node) {
if (node == null) {
return;
}
pos(node.left);
pos(node.right);
System.out.print(node.value+" ");
}
public static void main(String[] args) {
Node head = new Node(3);
head.left = new Node(2);
head.right = new Node(2);
head.left.left = new Node(4);
head.left.right = new Node(1);
head.right.left = null;
head.right.right = new Node(5);
pre(head);
System.out.println("========");
in(head);
System.out.println("========");
pos(head);
System.out.println("========");
}
这也是LeetCode上面的题,算是递归入门了