题目19：树的镜像

题目：完成一个函数，输入二叉树，该函数输出它的镜像.

 

二叉树的定义：

struct BinaryTreeNode{int m_value;BinaryTreeNode* m_pLeft;BinaryTreeNode* m_pRight;};

 

实现左右子树的交换

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); delete [] pTemp;}