【剑指Offer学习】【面试题19 ：二叉树的镜像】

https://blog.csdn.net/derrantcm/article/details/46678173

 

typedef struct treeNode
{
    int m_nValue;
    struct treeNode* left;
    struct treeNode* right;
} tree;

void mirror(tree* root) {
    if (root == NULL) {
        return;
    }
    tree * temp = root->left;
    root->left = root->right;
    root->right = temp;
    mirror(root->left);
    mirror(root->right);
}