Inorder traversal ( used to print initial and modified trees )
def printInorder ( root ) : NEW_LINE INDENT if ( root == None ) : NEW_LINE INDENT return NEW_LINE DEDENT printInorder ( root . left ) NEW_LINE print ( root . key , end = " ▁ " ) NEW_LINE printInorder ( root . right ) NEW_LINE DEDENT