输入一个二叉树,输出其镜像。
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
void Mirror(TreeNode *pRoot) {
if(pRoot==NULL)
return;
Mirror(pRoot->left);
Mirror(pRoot->right);
TreeNode* temp=pRoot->left;
pRoot->left=pRoot->right;
pRoot->right=temp;
}
};