题目链接:https://leetcode.com/problems/invert-binary-tree/#/description
/**
* 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* tmp = new TreeNode(NULL);
TreeNode* invertTree(TreeNode* root) {
if(root==NULL) return NULL;
tmp=root->right;
root->right=root->left;
root->left=tmp;
if(root->right) invertTree(root->right);
if(root->left) invertTree(root->left);
return root;
}
};