题解 | #二叉树的镜像# | C++

/**
 * 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) {
        if (pRoot) {
            TreeNode *l = pRoot->left, *r = pRoot->right;
            pRoot->left = r;
            pRoot->right = l;
            Mirror(pRoot->left);
            Mirror(pRoot->right);
        }
        return pRoot;
    }
};