CareerCup

This is how I will do it
1) traverse till the node and use and array say if we move left store 0 and move right store 1
2) Now again traverse the tree, reading the array, if 0 then move right else move left

this will give us the mirror.

Node getMirrorNode(Node currNode , node mirrorNode , int data)
{
if(currNode == null || mirrorNode==null)
return null;

if(currNode->value == data)
return mirrorNode;

Node tmp;
tmp = getMirrorNode(currNode->left , mirrorNode->right , data);
if(tmp != null)
return tmp;

tmp = getMirrorNode(currNode->right , mirrorNode->left , data);
if(tmp != null)
return tmp;

}

I think mirror node of a node would always be its other sibling.
i.e. if this node is a left child of its parent then the mirror node would be the right child of its parent.
so..
if(node->right->data == data) return node->left;
else if (node->left->data == data) return node->right;
else{ tmp = getMirrorNode(node->left, data); if (tmp!= null) return tmp;
tmp = getMirrorNode(node->right, data); if (tmp!= null) return tmp;
}

No mirror can not be put in the middle of any node be it root or another node.
Tree Original Mirror Reflection
9 | 9
4 16 | 16 4
3 5 12 | 12 5 3

nice question!

No, by the mirror node we mean .. If we compare the path from root node to the two nodes .. the path should be exactly opposite at each turn ... i.e. for every right move in the first path you should have a left move in the second path.

And that, in fact, is the answer .. find path and reverse it accordingly to find the mirror node.

public Node mirrorNode(Node head, int data){

if(head==null)
return null;
Node tmp = head;
Node mirror = head;

while(tmp!=null){
if(data==tmp.data)
return mirror;
if(data<tmp.data){
tmp = tmp.left
mirror=mirror.right
}else if(data>tmp.data){
tmp = tmp.right;
miror= mirror.left
}

}
return null;
}

is not simple to first find the path.. is it left right and left.. then mirror node must be right left and right..

but it might take a while to find the path :(

i think here you only need to exchange the link to find mirror

mirror(node *root)
{
if(root==NULL)
return;

node *temp;

mirror(root->left);
mirror(root->right);
temp=root->left;
root->left=root->right;
root->right=temp;

}

i think it should work

Node * mirror(Node *n)
{
Node *temp = n;
while(n!=NULL && n->value!=value && temp!=NULL)
{
if(n->value < value)
{
n = n->right;
temp = temp->left;
}

else
{
n = n->left;
temp = temp->right;
}
}

if(temp!=NULL && n!=NULL)
return temp;

else
return NULL;

}


@vicky, iterative solution is better than recursive