题解 | #二叉树的镜像#
二叉树的镜像
https://www.nowcoder.com/practice/a9d0ecbacef9410ca97463e4a5c83be7
//空树返回 if(pRoot == NULL) return NULL; //先递归子树 TreeNode* left = Mirror(pRoot->left); TreeNode* right = Mirror(pRoot->right); //交换 pRoot->left = right; pRoot->right = left; return pRoot;