题目描述
操作给定的二叉树,将其变换为源二叉树的镜像。
C++
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
TreeNode *p1 = NULL;
void Mirror(TreeNode *pRoot) {
if(pRoot == NULL) return;
p1 = pRoot->left;
pRoot->left = pRoot->right;
pRoot->right = p1;
Mirror(pRoot->left);
Mirror(pRoot->right);
}
};
思路:
递归实现,前序遍历交换左右子树即可