二叉树的镜像
class Solution {
public:
void Mirror(TreeNode *pRoot) {
if(!pRoot)
return;
if(!pRoot->left && !pRoot->right) return; //交换左右孩子 TreeNode * temp = pRoot->left; pRoot->left = pRoot->right; pRoot->right = temp; //递归 Mirror(pRoot->left); Mirror(pRoot->right); }
};