Pattern
Pattern
Pattern
Use recursion or a stack to compute information from subtrees.
Define what each recursive call returns to its parent.
def dfs(node):
if not node:
return 0
left = dfs(node.left)
right = dfs(node.right)
return 1 + max(left, right)
answer = dfs(root)