面试题27. 二叉树的镜像
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: TreeNode* mirrorTree(TreeNode* root) { if (root == NULL) return NULL; mirrorTree(root->left); mirrorTree(root->right); TreeNode *tmp = root->left; root->left = root->right; root->right = tmp; return root; } };