Inorder traversal of a binary tree
def inorder ( temp ) : NEW_LINE INDENT if ( not temp ) : NEW_LINE INDENT return NEW_LINE DEDENT inorder ( temp . left ) NEW_LINE print ( temp . key , end = " ▁ " ) NEW_LINE inorder ( temp . right ) NEW_LINE DEDENT