DSA · Theory

Morris traversal for Postorder

Theory

752/810

Morris traversal for Postorder

If you can teach Morris traversal for Postorder using a Morris traversal for Postorder dry-run, you know it. If you only know the heading, you don’t.

Morris traversal for Postorder on the board: one Morris traversal for Postorder step Isha can write from memory. Then say what a Morris traversal for Postorder dry-run looks like after.

Morris traversal for Postorder exists so Isha can keep a Morris traversal for Postorder dry-run correct in a small live site.

Use Morris traversal for Postorder when a Morris traversal for Postorder dry-run must stay clear. If a simpler DSA step works, use that instead.

Morris traversal for Postorder trap: only reciting the name of Morris traversal for Postorder. Isha loses marks for that every viva.

Place Morris traversal for Postorder next to nearby DSA work — one Morris traversal for Postorder step Isha can write from memory is the link.

One breath for Morris traversal for Postorder, then a Morris traversal for Postorder dry-run, then only reciting the name of Morris traversal for Postorder. Sit down.

Exam tip

For Morris traversal for Postorder: definition + a small live site + one failure.

Example

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

def inorder(n):
    if not n:
        return []
    return inorder(n.left) + [n.val] + inorder(n.right)

root = Node(2, Node(1), Node(3))
print(inorder(root))

Morris traversal for Postorder — inorder walks left → node → right (sorted order for a BST).

Short notes

DefMorris traversal for Postorder — Isha uses it for a Morris traversal for Postorder dry-run in a small live site.
RuleMorris traversal for Postorder → one Morris traversal for Postorder step Isha can write from memory.
RememberMorris traversal for Postorder + Big-O (a small live site).
UseMorris traversal for Postorder in a small live site (a Morris traversal for Postorder dry-run).
TrapMorris traversal for Postorder — only reciting the name of Morris traversal for Postorder.
ExMorris traversal for Postorder → a Morris traversal for Postorder dry-run.

class Node: def __init__(self, val, left=None, right=None): self.val, self.left, self.right = val, left, right def inorder(n): if not n: return [] return inorder(n.left) + [n.val] + inorder(n.right) root = Node(2, Node(1), Node(3)) print(inorder(root))

Morris traversal for Postorder

Example

Short notes

Questions

Morris traversal for Postorder

Example

Short notes

Questions