二進制搜索樹迭代式遍歷遍歷，無需額外存儲

Question

對於有序二叉搜索樹遍歷，有一種不使用輔助存儲器（堆棧，父指針，已訪問標志）的迭代算法，稱為Morris Traversal 。 是否有類似的用於預遍歷和后遍歷的算法？

Answer 1

剛剛想出了遍歷遍歷的解決方案，可能會奏效

Initialize current as root 
While current is not NULL
If current does not have right child
  a) print current root
  b) Go to the left, i.e., current = current->left
Else
  a) print current root
  a) Make the whole right sub-tree of current as the left node of the rightmost child in the left sub tree(inorder predecessor of current)
  b) Go to the left child, i.e., current = current->left

如果算法有問題，請發表評論