If l == r , therefore no right or left subtree . So , it must be leaf Node , print it .
if ( l == r ) : NEW_LINE INDENT print ( inorder [ l ] , end = " ▁ " ) NEW_LINE ind [ 0 ] = ind [ 0 ] + 1 NEW_LINE return NEW_LINE DEDENT