[剑指offer][面试题19]二叉树的镜像

请完成一个函数,输入一个二叉树,该函数输出它的镜像。

#include <iostream>using namespace std;struct Node{int   m_nData;Node *m_pLeft;Node *m_pRight;};void mirrorBinaryTree(Node *pRoot){if (pRoot==NULL){return;}Node *pLeft     = pRoot->m_pLeft;pRoot->m_pLeft  = pRoot->m_pRight;pRoot->m_pRight = pLeft;mirrorBinaryTree(pRoot->m_pLeft);mirrorBinaryTree(pRoot->m_pRight);}int main(){/* Original           Mirrored        8                 8       / \               / \      6  10     ==>     10  6     / \ / \           / \ / \    5  7 9 11         11 9 7  5 */}