二叉树的镜像

Desicription

操作给定的二叉树,将其变换为源二叉树的镜像。

二叉树的镜像定义:源二叉树

1
2
3
4
5
6
7
8
9
10
11
8
/ \
6 10
/ \ / \
5 7 9 11
镜像二叉树
8
/ \
10 6
/ \ / \
11 9 7 5

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
private:
void Modify(TreeNode* pRoot) {
if(!pRoot) {
return ;
}
TreeNode* tempNode = pRoot->left;
pRoot->left = pRoot->right;
pRoot->right = tempNode;
Modify(pRoot->left);
Modify(pRoot->right);
}
public:
void Mirror(TreeNode *pRoot) {
Modify(pRoot);
}
};