給定一棵二叉樹(shù)的頭節(jié)點(diǎn) head，完成二叉樹(shù)的先序、中序和后序遍歷。
如果二叉樹(shù)的節(jié)點(diǎn)數(shù)為 N，要求時(shí)間復(fù)雜度為 O(N)，額外空間復(fù)雜度為 O(1)

主要思想：莫爾斯遍歷，使用空閑右指針，回到后續(xù)節(jié)點(diǎn)，只需要關(guān)心一個(gè)節(jié)點(diǎn)的左子樹(shù)的最右節(jié)點(diǎn)是懸空還是指向后續(xù)節(jié)點(diǎn)

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){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;}}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(cur != 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.print(cur1.value + " ");cur1 = cur1.left;continue;}else{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){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(); }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; }

總結(jié)

以上是生活随笔為你收集整理的遍历二叉树的神级方法（Morris）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。