CareerCup

void mirror( node* T )
{
      if( !T )return NULL; 
      
      mirror(T->left);
      mirror(T->right);
      
      swap( T->left,T->right );
      
      }

node* copyTree(node* root)
{
	if(root==NuLL)
		return NULL;
	else
	{
		node* cproot=new node();
		cproot->left=copyTree(root->left);
		cproot->right=copyTree(root->right);
		return cproot;
	}
}

void mirrorTree(Node **orig, Node** mir) {
   if(*orig == NULL) return NULL;
   *mir = (Node*) malloc (sizeof(Node))
   if(*mir == NULL) return NULL;
   *mir->data = *orig->data;
   *mir->left = NULL;
   *mir->right = NULL;
   mirrorTree(&(*orig->left), &(*mir->right));
   mirrorTree(&(*orig->right), &(*orig->left));
}