二叉树——遍历（Morris遍历）

//Morris遍历
//一种遍历二叉树的方式，并且时间复杂度O(N)，额外空间复杂度O(1)
//通过利用原树中大量空闲指针的方式，达到节省空间的目的

//Morris遍历细节
//假设来到当前节点cur，开始时cur来到头节点位置
//1）如果cur没有左孩子，cur向右移动(cur = cur.right)
//2）如果cur有左孩子，找到左子树上最右的节点mostRight：
//a.如果mostRight的右指针指向空，让其指向cur，
//然后cur向左移动(cur = cur.left)
//b.如果mostRight的右指针指向cur，让其指向null，
//然后cur向右移动(cur = cur.right)
//3）cur为空时遍历停止

//Morris遍历的实质
//建立一种机制，对于没有左子树的节点只到达一次，对于有左子树的节点会到达两次
//morris遍历时间复杂度的证明
public class MorrisTraversal {
	
	public static class Node {
		public int value;
		Node left;
		Node right;

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

	//中序遍历
	public static void morrisIn(Node head) {
		if (head == null) {
			return;
		}
		Node cur1 = head;
		Node cur2 = null;
		while (cur1 != null) {
			cur2 = cur1.left;
			if (cur2 != null) {
				//当cur2的右节点不为空 且 cur2的右节点不指向cur1
				while (cur2.right != null && cur2.right != cur1) {
					cur2 = cur2.right;
				}
				//如果右节点为空，令该右节点指向头结点
				if (cur2.right == null) {
					cur2.right = cur1;
					cur1 = cur1.left;
					continue;
				} else {	//否则此时右节点已经指向cur1了
					cur2.right = null;
				}
			}
			System.out.print(cur1.value + " ");		//将打印的步骤修改至此位置就是先序和中序的区别
			cur1 = cur1.right;
		}
		System.out.println();
	}

	//改先序遍历
	public static void morrisPre(Node head) {
		if (head == null) {
			return;
		}
		Node cur1 = head;
		Node cur2 = null;
		while (cur1 != null) {
			cur2 = cur1.left;
			if (cur2 != null) {	//存在左子树
				while (cur2.right != null && cur2.right != cur1) {
					cur2 = cur2.right;
				}
				//cur2变成cur左子树上最后的节点
				if (cur2.right == null) {	//第一次来到cur
					cur2.right = cur1;
					System.out.print(cur1.value + " ");
					cur1 = cur1.left;
					continue;
				} else {	//mostRight.right == cur即已经修改了指向，则把原先的修改重新置空
					cur2.right = null;
				}
			} else {	//没有左子树的情况
				System.out.print(cur1.value + " ");
			}
			cur1 = cur1.right;
		}
		System.out.println();
	}

	//后序遍历
	//当第二次遇到某一个节点时，逆序打印左树右边界
	//最后再逆序打印所有节点
	public static void morrisPos(Node head) {
		if (head == null) {
			return;
		}
		Node cur1 = head;
		Node cur2 = null;
		while (cur1 != null) {
			cur2 = cur1.left;
			if (cur2 != null) {
				while (cur2.right != null && cur2.right != cur1) {
					cur2 = cur2.right;
				}
				if (cur2.right == null) {
					cur2.right = cur1;
					cur1 = cur1.left;
					continue;
				//第二次来到某个节点时，将原先的修改置空，然后逆序打印左树
				} else {
					cur2.right = null;
					printEdge(cur1.left);
				}
			}
			cur1 = cur1.right;
		}
		printEdge(head);
		System.out.println();
	}

	//以x为头的树，逆序打印这棵树的右边界
	public static void printEdge(Node head) {
		Node tail = reverseEdge(head);
		Node cur = tail;
		while (cur != null) {
			System.out.print(cur.value + " ");
			cur = cur.right;
		}
		reverseEdge(tail);
	}

	//调转
	public static Node reverseEdge(Node from) {
		Node pre = null;
		Node next = null;
		while (from != null) {
			next = from.right;
			from.right = pre;
			pre = from;
			from = next;
		}
		return pre;
	}

	// for test -- print tree
	public static void printTree(Node head) {
		System.out.println("Binary Tree:");
		printInOrder(head, 0, "H", 17);
		System.out.println();
	}

	public static void printInOrder(Node head, int height, String to, int len) {
		if (head == null) {
			return;
		}
		printInOrder(head.right, height + 1, "v", len);
		String val = to + head.value + to;
		int lenM = val.length();
		int lenL = (len - lenM) / 2;
		int lenR = len - lenM - lenL;
		val = getSpace(lenL) + val + getSpace(lenR);
		System.out.println(getSpace(height * len) + val);
		printInOrder(head.left, height + 1, "^", len);
	}

	public static String getSpace(int num) {
		String space = " ";
		StringBuffer buf = new StringBuffer("");
		for (int i = 0; i < num; i++) {
			buf.append(space);
		}
		return buf.toString();
	}

	public static void main(String[] args) {
		Node head = new Node(4);
		head.left = new Node(2);
		head.right = new Node(6);
		head.left.left = new Node(1);
		head.left.right = new Node(3);
		head.right.left = new Node(5);
		head.right.right = new Node(7);
		printTree(head);
		morrisIn(head);
		morrisPre(head);
		morrisPos(head);
		printTree(head);

	}

}