Perform Inorder Traversal
def printInorderTree ( root ) : NEW_LINE INDENT if ( root == None ) : NEW_LINE INDENT return ; NEW_LINE DEDENT printInorderTree ( root . left ) ; NEW_LINE print ( root . key , end = ' ▁ ' ) NEW_LINE printInorderTree ( root . right ) ; NEW_LINE DEDENT