先左、右子树翻转下,然后交换位置,递归
/**
* 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* invertTree(TreeNode* root) {
if(!root) return root;
TreeNode* l=invertTree(root->left),*r=invertTree(root->right);
root->left=r,root->right=l;
return root;
}
};