Morries遍历

package class05;

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

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

  public static void morries(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;
        }
      }
      cur1 = cur1.right;
    }
  }

  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;
        }
        if (cur2.right == null) {
          cur2.right = cur1;
          System.out.println(cur1.value);
          cur1 = cur1.left;
          continue;
        } else {
          cur2.right = null;
        }

      } else {
        System.out.println(cur1.value);
      }
      cur1 = cur1.right;
    }
  }

  public static void morripos(Node head) {
    if (head.left == 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);
  }

  public static void printEdge(Node head) {
    Node tail = reverseEdge(head);
    Node cur = tail;
    while (cur != null) {
      System.out.println(cur.value);
      cur = cur.right;
    }
    reverseEdge(tail);
  }

  public static Node reverseEdge(Node head) {
    Node pre = null;
    Node next = null;
    while (head != null) {
      next = head.right;
      next.right = pre;
      pre = head;
      head = next;
    }
    return pre;
  }
}