二叉树的镜像

代码:

struct BinaryTreeNode{    int m_nValue;    BinaryTreeNode* m_pLeft;    BinaryTreeNode* m_pRight;};void MirrorRecursive(BinaryTreeNode* pTree){    if (pTree == nullptr || (pTree->m_pLeft == nullptr && pTree->m_pRight == nullptr))        return;    BinaryTreeNode* pTemp = pTree->m_pLeft;    pTree->m_pLeft = pTree->m_pRight;    pTree->m_pRight = pTemp;    if (pTree->m_pLeft)        MirrorRecursive(pTree->m_pLeft);    if (pTree->m_pRight)        MirrorRecursive(pTree->m_pRight);}