Apx: Morris Traversal

A 3rd way the traverse a binary tree other than stack or recursion

• Learning Material

  • 解法三 Morris Traversal

  • CPP Morris Traversal

  • L37. Morris Traversal | Preorder | Inorder | C++ | Java

• Practices

  • M 114. Flatten Binary Tree to Linked List (expecting pre-order outcome

  • M 915 · Inorder Predecessor in BST (implement using Morris Traversal

  • M 430. Flatten a Multilevel Doubly Linked List (conceptually similar