inorder_dfs.py

def dfs(root: TreeNode) -> TreeNode:
    stack = []

    while root or stack:
        while root:
            stack.append(root)
            root = root.left

        root = stack.pop()
        
        print('Processing {}'.format(root.val))

        root = root.right