Tree Traversal Target: 10s
Both null → True. One null → False. Values equal AND both subtrees same → True. Base case for subtree check.
def isSameTree(p, q):
if not p and not q: return True
if not p or not q: return False
return (p.val == q.val and
isSameTree(p.left, q.left) and
isSameTree(p.right, q.right))
Type it from memory. Go.