有苦有乐的算法 --- 用栈和递归的方式实现二叉树的前序遍历、中序遍历、后序遍历

前序遍历

递归方式：

public static void pre(Node head) {
	if (head == null) {
		return;
	}
	System.out.println(head.value);
	pre(head.left);
	pre(head.right);

}

栈的方式：

public static void pre(Node head) {
	System.out.print("pre-order: ");
	if (head != null) {
		Stack<Node> stack = new Stack<Node>();
		stack.add(head);
		while (!stack.isEmpty()) {
			head = stack.pop();
			System.out.print(head.value + " ");
			if (head.right != null) {
				stack.push(head.right);
			}
			if (head.left != null) {
				stack.push(head.left);
			}
		}
	}
	System.out.println();
}

中序遍历

递归方式：

public static void in(Node head) {
	if (head == null) {
		return;
	}
	in(head.left);
	System.out.println(head.value);
	in(head.right);
}

栈的方式：

public static void in(Node cur) {
	System.out.print("in-order: ");
	if (cur != null) {
		Stack<Node> stack = new Stack<Node>();
		while (!stack.isEmpty() || cur != null) {
			if (cur != null) {
				stack.push(cur);
				cur = cur.left;
			} else {
				cur = stack.pop();
				System.out.print(cur.value + " ");
				cur = cur.right;
			}
		}
	}
	System.out.println();
}

后续遍历

递归方式：

public static void pos(Node head) {
	if (head == null) {
		return;
	}
	pos(head.left);
	pos(head.right);
	System.out.println(head.value);
}

栈的方式：

public static void pos(Node h) {
	System.out.print("pos-order: ");
	if (h != null) {
		Stack<Node> stack = new Stack<Node>();
		stack.push(h);
		Node c = null;
		while (!stack.isEmpty()) {
			c = stack.peek();
			if (c.left != null && h != c.left && h != c.right) {
				stack.push(c.left);
			} else if (c.right != null && h != c.right) {
				stack.push(c.right);
			} else {
				System.out.print(stack.pop().value + " ");
				h = c;
			}
		}
	}
	System.out.println();
}