题解 | #二叉树的镜像#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pRoot TreeNode类 
     * @return TreeNode类
     */
    TreeNode* Mirror(TreeNode* pRoot) {
        // write code here
        return zhuanhuan(pRoot);
    }
    
    TreeNode* zhuanhuan(TreeNode* pRoot){
        if(pRoot == nullptr){
            return pRoot;
        }
        
        TreeNode* left = zhuanhuan(pRoot->right);
        TreeNode* right = zhuanhuan(pRoot->left);
        
        pRoot->left = left;
        pRoot->right = right;
        
        return pRoot;
    }
    
};