DSA · Theory

Inorder Traversal

Theory

147/810

Inorder Traversal

Inorder Traversal is a DSA topic. In plain words you use it for a short Inorder Traversal example in a short dry-run on paper. Don’t start with a slogan — start with that picture.

Smallest example: the smallest Inorder Traversal example you can type. Type it, run it, and say what you see. If you can do that from memory, you know Inorder Traversal.

From the example next to this theory — Inorder Traversal — inorder walks left → node → right (sorted order for a BST).

Trap — only saying “Inorder Traversal” with no example. Fix that before you talk about advanced DSA.

Viva — what is Inorder Traversal? Then show the smallest Inorder Traversal example you can type. Then name the trap.

Exam tip

What is Inorder Traversal? Show this: the smallest Inorder Traversal example you can type. Trap: only saying “Inorder Traversal” with no example.

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))

Inorder Traversal — inorder walks left → node → right (sorted order for a BST).

Short notes

DefInorder Traversal — a short Inorder Traversal example in a short dry-run on paper.
Rulethe smallest Inorder Traversal example you can type
Traponly saying “Inorder Traversal” with no example
Usea short dry-run on paper

DSA · Theory

Inorder Traversal

← All stacks

Theory

147/810

Inorder Traversal

Inorder Traversal is a DSA topic. In plain words you use it for a short Inorder Traversal example in a short dry-run on paper. Don’t start with a slogan — start with that picture.

Smallest example: the smallest Inorder Traversal example you can type. Type it, run it, and say what you see. If you can do that from memory, you know Inorder Traversal.

From the example next to this theory — Inorder Traversal — inorder walks left → node → right (sorted order for a BST).

Trap — only saying “Inorder Traversal” with no example. Fix that before you talk about advanced DSA.

Viva — what is Inorder Traversal? Then show the smallest Inorder Traversal example you can type. Then name the trap.

Exam tip

What is Inorder Traversal? Show this: the smallest Inorder Traversal example you can type. Trap: only saying “Inorder Traversal” with no example.

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))

Inorder Traversal — inorder walks left → node → right (sorted order for a BST).

Short notes

DefInorder Traversal — a short Inorder Traversal example in a short dry-run on paper.
Rulethe smallest Inorder Traversal example you can type
Traponly saying “Inorder Traversal” with no example
Usea short dry-run on paper

Inorder Traversal

Example

Short notes

Questions

Inorder Traversal

Example

Short notes

Questions