19.二叉树的镜像

void MirrorRecursively(BinaryTreeNode* pNode)
{
if ((pNode == NULL) || (pNode->m_pLeft == NULL&&pNode->m_pRight))
return;
BinaryTreeNode *pTemp = pNode->m_pLeft;
pNode->m_pLeft = pNode->m_pRight;
pNode->m_pRight = pTemp;
if (pNode->m_pLeft)
MirrorRecursively(pNode->m_pLeft);
if (pNode->m_pRight)
MirrorRecursively(pNode->m_pRight);
}