二叉树的镜像

 1 void Mirror(BinaryTreeNode* pHead)
 2 {
 3     if ( pHead == NULL || ( pHead->m_pLeft == NULL && pHead->m_pRight == NULL ))
 4     {
 5         return;
 6     }
 7     else
 8     {
 9         BinaryTreeNode* pTemp = pHead->m_pRight ;
10         pHead->m_pRight = pHead->m_pLeft ;
11         pHead->m_pLeft = pTemp ;
12     }
13     Mirror(pHead->m_pLeft);
14     Mirror(pHead->m_pRight);
15 }