Why Morris Traversal Inorder Without Stack in DSA Python?

The Big Idea

What if you could explore a huge tree without carrying any extra memory baggage?

The Scenario

Imagine you want to visit every room in a big house, but you have no map and no way to remember which rooms you already visited except by writing notes on paper. Carrying and managing all those notes is tiring and easy to lose track.

The Problem

Using a stack or recursion to remember which rooms (nodes) to visit next means extra memory and complexity. It can slow you down and make your plan bulky, especially if the house is huge. Also, managing this extra memory can cause mistakes and confusion.

The Solution

Morris Traversal lets you visit every room in the house without any extra notes or memory. It cleverly uses the house's own doors (tree links) to remember where to go next, so you never get lost and don't need extra space.

Before vs After

✗ Before

def inorder_traversal(root):
    stack = []
    current = root
    while current or stack:
        while current:
            stack.append(current)
            current = current.left
        current = stack.pop()
        print(current.val)
        current = current.right

✓ After

def morris_inorder_traversal(root):
    current = root
    while current:
        if not current.left:
            print(current.val)
            current = current.right
        else:
            predecessor = current.left
            while predecessor.right and predecessor.right != current:
                predecessor = predecessor.right
            if not predecessor.right:
                predecessor.right = current
                current = current.left
            else:
                predecessor.right = None
                print(current.val)
                current = current.right

What It Enables

You can traverse a binary tree in order using only the tree itself, saving memory and making your code faster and cleaner.

Real Life Example

When working with very large data trees in limited-memory devices like embedded systems or IoT gadgets, Morris Traversal helps process data efficiently without extra memory.

Key Takeaways

Morris Traversal visits nodes without extra memory like stacks or recursion.

It temporarily changes tree links to remember paths, then restores them.

This method is efficient for memory-limited environments.

Practice

1. What is the main advantage of Morris Traversal for inorder tree traversal compared to the traditional recursive or stack-based methods?

easy

A. It uses no extra space for stack or recursion.

B. It is faster than all other traversal methods.

C. It only works on binary search trees.

D. It modifies the tree permanently.

Solution

1. Step 1: Understand Morris Traversal space usage

   Morris Traversal uses threaded binary trees to avoid recursion or stack, so it uses O(1) extra space.

2. Step 2: Compare with other methods

   Traditional inorder traversal uses recursion or stack which requires O(h) space, where h is tree height.

3. Final Answer:

   It uses no extra space for stack or recursion. -> Option A

4. Quick Check:

   Space complexity = O(1) [OK]

Hint: Morris uses threads, no stack or recursion needed [OK]

Common Mistakes:

• Thinking Morris is faster in time complexity
• Believing it only works on BSTs
• Assuming it permanently changes the tree

2. Which of the following code snippets correctly initializes the current node for Morris inorder traversal in Python?

easy

A. current = root

B. current = None

C. current = root.left

D. current = root.right

Solution

1. Step 1: Identify starting point for traversal

   Morris traversal starts from the root node to cover the entire tree.

2. Step 2: Check initialization options

   Setting current = root ensures traversal begins at the tree's root.

3. Final Answer:

   current = root -> Option A

4. Quick Check:

   Start at root node [OK]

Hint: Always start traversal from root node [OK]

Common Mistakes:

• Starting from None causes no traversal
• Starting from root.left misses root node
• Starting from root.right misses left subtree

3. What will be the output of the Morris inorder traversal on the following binary tree?

    2
   / \
  1   3

Assuming the traversal prints node values in order.

medium

A. [2, 1, 3]

B. [1, 3, 2]

C. [3, 2, 1]

D. [1, 2, 3]

Solution

1. Step 1: Understand inorder traversal order

   Inorder traversal visits left subtree, root, then right subtree.

2. Step 2: Apply Morris traversal order

   For the tree, left is 1, root is 2, right is 3, so output is [1, 2, 3].

3. Final Answer:

   [1, 2, 3] -> Option D

4. Quick Check:

   Inorder = left-root-right = [1, 2, 3] [OK]

Hint: Inorder = left, root, right always [OK]

Common Mistakes:

• Confusing preorder or postorder with inorder
• Misreading tree structure
• Assuming traversal prints in insertion order

4. Consider this snippet of Morris inorder traversal code in Python:

current = root
while current:
    if current.left is None:
        print(current.val)
        current = current.right
    else:
        pre = current.left
        while pre.right and pre.right != current:
            pre = pre.right
        if pre.right is None:
            pre.right = current
            current = current.left
        else:
            pre.right = None
            print(current.val)
            current = current.right

What is the main bug if the line pre.right = None is missing?

medium

A. The traversal will print nodes in preorder instead of inorder.

B. The traversal will skip the root node.

C. The traversal will enter an infinite loop.

D. The traversal will cause a syntax error.

Solution

1. Step 1: Understand role of pre.right = None

   This line removes the temporary thread created to return to the root after left subtree traversal.

2. Step 2: Consequence of missing this line

   If not removed, the thread remains, causing the loop to revisit nodes endlessly, creating an infinite loop.

3. Final Answer:

   The traversal will enter an infinite loop. -> Option C

4. Quick Check:

   Missing thread removal = infinite loop [OK]

Hint: Always remove temporary threads to avoid loops [OK]

Common Mistakes:

• Thinking it causes syntax error
• Assuming it changes traversal order
• Believing it skips nodes

5. You want to modify Morris inorder traversal to collect node values in a list instead of printing them. Which of the following code changes correctly achieves this without changing the traversal logic?

result = []
current = root
while current:
    if current.left is None:
        # Change here
        current = current.right
    else:
        pre = current.left
        while pre.right and pre.right != current:
            pre = pre.right
        if pre.right is None:
            pre.right = current
            current = current.left
        else:
            pre.right = None
            # Change here
            current = current.right

hard

A. Replace only second '# Change here' line with result.append(current.val)

B. Replace both '# Change here' lines with result.append(current.val)

C. Replace only first '# Change here' line with result.append(current.val)

D. Replace both '# Change here' lines with print(current.val)

Solution

1. Step 1: Identify where nodes are visited

   In Morris traversal, nodes are visited and printed in two places: when left is None and after removing thread.

2. Step 2: Replace print with appending to list

   To collect values, replace both print statements with result.append(current.val) to capture all visited nodes.

3. Final Answer:

   Replace both '# Change here' lines with result.append(current.val) -> Option B

4. Quick Check:

   Collect all visited nodes in list [OK]

Hint: Append values at both visit points to collect all nodes [OK]

Common Mistakes:

• Appending only once misses some nodes
• Leaving print statements causes unwanted output
• Changing traversal logic breaks correctness