/*
题目:二叉树的镜像
8
/ \
6 10
/ \ / \
5 7 9 11
输出的镜像为:
8
/ \
10 6
/ \ / \
11 9 7 5
先交换根节点的左右子节点,
然后递归的交换左右子节点的左右子节点
*/
void MirrorRecursively(BinaryTreeNode *pNode)
{
if(pNode==nullptr)
return;
if(pNode->left==nullptr || pNode->right==nullptr)
return;
BinaryTreeNode *tmp=pNode->left;
pNode->left=pNode->right;
pNode->right=tmp;
if(pNode->left)
MirrorRecursively(pNode->left);
if(pNode->right)
MirrorRecursively(pNode->right);
}
/*翻转一棵二叉树。
示例:
输入:
4
/ \
2 7
/ \ / \
1 3 6 9
输出:
4
/ \
7 2
/ \ / \
9 6 3 1
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
if(root==NULL)
return NULL;
invertTree(root->left);
invertTree(root->right);
swap(root->left,root->right);
return root;
}
};