Binary Tree Issues in C++

I successfully implemented Binary search trees in C++, but have problems in presenting or traversing in different formats, I just wrote a client function which decides whether a tree is balanced or not. But i am unable to print the mirror image of a tree ? I need some one to help me with this in C++. I do have all required working methods written already. What all we need to do it write a client function using those methods to print mirror image of the tree, left indentation and few more. I will attach my client function which i wrote for checking tree is balanced or not. More details we be given once the bidder is interested. To make your task more easier i do have the pseudo code. I know the logic but implementation problems. Exact requirement listed at the end as attachment ## Deliverables Look at my program in the attachment.