递归的翻转左子树,递归的翻转右子树,然后root->left = right, root->right = left即可
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
if(root==NULL) return root;
auto left = invertTree(root->left);
auto right = invertTree(root->right);
root->left = right;
root->right = left;
return root;
}
};