Workspace

Problem workspace

3 day streakD

Morris Inorder Traversal

MediumTreesTraversals

The challenge

Produce inorder traversal without recursion or an auxiliary stack.

The tree must be mutable and exclusively accessible during traversal. Complete the traversal so every temporary pointer is removed.

Example

The balanced example outputs [2, 4, 6, 8, 10, 12, 14] and ends with the original tree.

Use the walkthrough below to inspect the input and each state change.

See Morris, step by step

Follow the branches. Watch the state change.

7 input nodesL = left · R = right
Inspect the input.Labels identify node objects; numbers are their values. Left and right child pointers define the tree. Node labels identify objects; numbers show their values. The pointer table below provides the same structure in text.LRLRLR2D4B6E8A · root10F12C14G
CurrentProcessedPending
View child pointers & node state
Node state · null means no child
NodeValueLeftRightState
A8BC—
B4DE—
C12FG—
D2nullnull—
E6nullnull—
F10nullnull—
G14nullnull—
Step 01 / 12

Inspect the input.

Labels identify node objects; numbers are their values. Left and right child pointers define the tree.

root = A:8
View original input

A:8 [L:B, R:C] · B:4 [L:D, R:E] · C:12 [L:F, R:G] · D:2 [L:null, R:null] · E:6 [L:null, R:null] · F:10 [L:null, R:null] · G:14 [L:null, R:null]

Node IDs stay distinct even when values repeat. Pointer mutations update the diagram; removed nodes remain in the state table for reference.

Put it into code

Use an unused predecessor right pointer as a temporary return address.

Nodes store value, left, and right. C++ uses C++17 or later.

from collections import deque

class Node:
    def __init__(self, value, left=None, right=None):
        self.value = value
        self.left = left
        self.right = right

def morris_inorder(root):
    out, node = [], root
    while node:
        if not node.left:
            out.append(node.value)
            node = node.right
        else:
            pred = node.left
            while pred.right and pred.right is not node:
                pred = pred.right
            if pred.right is None:
                pred.right = node
                node = node.left
            else:
                pred.right = None
                out.append(node.value)
                node = node.right
    return out

A good place to start

Explore a pattern

A little guidance

Start with a pattern, read through a problem, and mark it solved when the idea clicks. Save anything you want to revisit.

New tutorials are added one at a time. Your bookmarks and solved checkmarks stay in this browser.

Explore the roadmap