思路:
遍历整个二叉树,遇到非叶子节点则,交换其两个子节点。遇到叶子节点则结束。
class Solution {
public:
void Mirror(TreeNode *pRoot) {
if(pRoot == NULL) return;
if(pRoot->left==NULL && pRoot->right==NULL) return;
TreeNode *temp = pRoot->left;
pRoot->left = pRoot->right;
pRoot->right = temp;
Mirror(pRoot->left);
Mirror(pRoot->right);
}
};