DSA · Theory

Maximum Width of a Binary Tree

Theory

175/810

Maximum Width of a Binary Tree

If you can teach Maximum Width of a Binary Tree using folder on disk, you know it. If you only know the heading, you don’t.

Keep Maximum Width of a Binary Tree small. Zara should finish folder on disk in a few lines, not a 40-line dump.

Without Maximum Width of a Binary Tree, a file explorer gets messy and folder on disk is hard to trust.

Use Maximum Width of a Binary Tree when folder on disk must stay clear. If a simpler DSA step works, use that instead.

Maximum Width of a Binary Tree trap — unbalanced BST becoming a list. Zara loses marks for that every viva.

After Maximum Width of a Binary Tree, Zara should still remember unbalanced BST becoming a list.

Close Maximum Width of a Binary Tree with: “If I skip it, folder on disk goes wrong like this: unbalanced BST becoming a list.”

Exam tip

Say Maximum Width of a Binary Tree in one breath, then left < root < right, then unbalanced BST becoming a list.

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

Maximum Width of a Binary Tree — inorder walks left → node → right (sorted order for a BST).

Short notes

DefMaximum Width of a Binary Tree — Zara uses it for folder on disk in a file explorer.
RuleMaximum Width of a Binary Tree → left < root < right.
RememberMaximum Width of a Binary Tree + a dry-run table (a file explorer).
UseMaximum Width of a Binary Tree in a file explorer (folder on disk).
TrapMaximum Width of a Binary Tree — unbalanced BST becoming a list.
ExMaximum Width of a Binary Tree → folder on disk.

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

Maximum Width of a Binary Tree

Example

Short notes

Questions

Maximum Width of a Binary Tree

Example

Short notes

Questions