二叉树非递归遍历

public static class TreeNode {
		int val = 0;
		TreeNode left = null;
		TreeNode right = null;

		public TreeNode(int val) {
			this.val = val;
		}
	}

	/*
	 * 1 2 3 4 5 6 null 7
	 * 
	 */
	public static void main(String[] args) {
		TreeNode t1 = new TreeNode(1);
		TreeNode t2 = new TreeNode(2);
		TreeNode t3 = new TreeNode(3);
		TreeNode t4 = new TreeNode(4);
		TreeNode t5 = new TreeNode(5);
		TreeNode t6 = new TreeNode(6);
		TreeNode t7 = new TreeNode(7);
		t1.left = t2;
		t1.right = t3;
		t2.left = t4;
		t2.right = t5;
		t3.left = t6;
		t4.left = t7;
		System.out.print("qianxu1: ");
		qianxu1(t1);
		System.out.println();
		System.out.print("qianxu2: ");
		qianxu2(t1);
		System.out.println();
		System.out.print("zhongxu1: ");
		zhongxu1(t1);
		System.out.println();
		System.out.print("zhongxu2: ");
		zhongxu2(t1);
		System.out.println();
		System.out.pr