A utility function to print indorder traversal of a binary tree
def printInorder ( root ) : NEW_LINE INDENT if ( root == None ) : NEW_LINE INDENT return ; NEW_LINE DEDENT printInorder ( root . left ) ; NEW_LINE print ( root . data , end = ' ▁ ' ) NEW_LINE printInorder ( root . right ) ; NEW_LINE DEDENT