题解 | #二叉树的镜像#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
public:
    TreeNode* Mirror(TreeNode* pRoot) 
    {
        if(pRoot == nullptr)
        {
            return nullptr;
        }

        TreeNode* left = Mirror(pRoot->left);
        TreeNode* right = Mirror(pRoot->right);

        pRoot->left = right;
        pRoot->right = left;

        return pRoot;
    }
};