二叉树的镜像定义：源二叉树
8
/ 6 10
/ \ / 5 7 9 11
镜像二叉树
8
/ 10 6
/ \ / 11 9 7 5
递归，在回溯过程中交换当前节点的左右儿子即可
/* struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) { } };*/ class Solution { public: void Mirror(TreeNode *pRoot) { if(pRoot == NULL) return; Mirror(pRoot->left); Mirror(pRoot->right); TreeNode* temp = pRoot->left; pRoot->left = pRoot->right; pRoot->right = temp; } };
原文：https://www.cnblogs.com/alan-W/p/14256556.html
