Microsoft Interview Question
find mirror of a binary tree
Interview Answer
Anonymous
Jul 28, 2012
void mirrorTree(node*q,node*m) { if(q!=NULL && q->r!=NULL) m->l=newnode(q->r->d,m); if(q!=NULL && q->l!=NULL) m->r=newnode(q->l->d,m); if(q!=NULL) { mirrorTree(q->l,m->r); mirrorTree(q->r,m->l); } }