问题描述
看到二叉树就用递归准没错
代码
/**
* 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 {
TreeNode *t;
public:
TreeNode* invertTree(TreeNode* root) {
if(root==NULL) return NULL;
invertTree (root->left);
invertTree (root->right);
t=root->left;
root->left =root->right;
root->right=t;
return root;
}
};