剑指offer 左右翻转二叉树

class Solution {
public:
    void Mirror(TreeNode *pRoot) {
        if(pRoot == nullptr) return;
        cout << pRoot->val << endl;
        auto temp = pRoot->left;
        pRoot->left = pRoot->right;
        pRoot->right = temp;
        Mirror(pRoot->left);
        Mirror(pRoot->right);
    }
};

剑指offer 左右翻转二叉树

原文：https://www.cnblogs.com/theodoric008/p/9535810.html