Skip to content

Instantly share code, notes, and snippets.

View recursion_to_iteration.py
def dfs_postorder_recursive(root):
if root is None:
return # base case
dfs_postorder_recursive(root.left) # LEFT
dfs_postorder_recursive(root.right) # RIGHT
visit(root) # VISIT
# T. Webster-like approach,
You can’t perform that action at this time.