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

struct BinaryTreeNode{int data;BinaryTreeNode *left;BinaryTreeNode *right;};void Mirror(BinaryTreeNode *pRoot){if(pRoot==NULL||pRoot->left==NULL||pRoot->right==NULL) return;BinaryTreeNode *tmp=pRoot->left;pRoot->left=pRoot->right;pRoot->right=tmp;if(pRoot->left)Mirror(pRoot->left);if(pRoot->right)Mirror(pRoot->right);}