如何用非递归方式实现二叉树的先序、中序、后序遍历？

如何用非递归方式实现二叉树的先序、中序、后序遍历？

先上递归的实现版本：

public static class Node {
		public int value;
		public Node left;
		public Node right;

		public Node(int data) {
			this.value = data;
		}
	}

	public static void preOrderRecur(Node head) {
		if (head == null) {
			return;
		}
		System.out.print(head.value + " ");
		preOrderRecur(head.left);
		preOrderRecur(head.right);
	}

	public static void inOrderRecur(Node head) {
		if (head == null) {
			return;
		}
		inOrderRecur(head.left);
		System.out.print(head.value + " ");
		inOrderRecur(head.right);
	}

	public static void posOrderRecur(Node head) {
		if (head == null) {
			return;
		}
		posOrderRecur(head.left);
		posOrderRecur(head.right);
		System.out.print(head.value + " ");
	}

重点讲如何使用非递归方式：通过栈实现

前序遍历打印：中、左、右

头节点不为空时，把头节点压入栈中

当栈不为空时，弹栈打印，依次把弹出节点的右节点和左节点压栈

中序遍历打印：左、中、右

把当前节点的所有左节点全部压栈，不再有左节点时弹栈打印，压入当前弹栈节点的右节点

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

后序遍历打印：左、右、中

将前序遍历的压栈顺序改变，变成：中、右、左

将本该打印的操作改为压栈，则出栈顺序为：左、右、中

public static void posOrderUnRecur1(Node head) {
		if (head != null) {
			Stack<Node> s1 = new Stack<Node>();
			Stack<Node> s2 = new Stack<Node>();
			s1.push(head);
			while (!s1.isEmpty()) {
				head = s1.pop();
				s2.push(head);
				if (head.left != null) {
					s1.push(head.left);
				}
				if (head.right != null) {
					s1.push(head.right);
				}
			}
			while (!s2.isEmpty()) {
				System.out.print(s2.pop().value + " ");
			}
		}
		System.out.println();
	}