求镜像的二叉树

//主要思路：遍历二叉树，然后交换左右子树void ChangeToMirror(BTreeNode* pRoot){if (pRoot == NULL){return;}BTreeNode* pTempNode = pRoot->pLeft;pRoot->pLeft  =  pRoot->pRight;pRoot->pRight =  pTempNode;ChangeToMirror(pRoot->pLeft);ChangeToMirror(pRoot->pRight);}