题目:
操作给定的二叉树,将其变换为源二叉树的镜像。输入描述:
二叉树的镜像定义:源二叉树
8
/ \
6 10
/ \ / \
5 7 9 11
镜像二叉树
8
/ \
10 6
/ \ / \
11 9 7 5
- 代码:
class Solution {
public:
void Mirror(TreeNode *pRoot) {
if(pRoot==NULL)return;
TreeNode* recept;
recept = pRoot->left;
pRoot->left = pRoot->right;
pRoot->right = recept;
Mirror(pRoot->left);
Mirror(pRoot->right);
}//递归调用
};
- 剑指Offer上的代码
void Mirror(TreeNode *pRoot){
if ((pRoot == NULL) || (pRoot->left == NULL && pRoot->right == NULL))
return;
TreeNode* pTemp = pRoot->left;
pRoot->left = pRoot->right;
pRoot->right = pTemp;
if (pRoot->left)
Mirror(pRoot->left);
if (pRoot->right)
Mirror(pRoot->right);
}