递归
思路:和值交换的思路相似,将其左右子树对调即可
1. 如果当前树为空则退出递归
2. 如果当前树不为空则交换左右子树,然后在让其左右子树进入交换函数(递归),直至遇到条件1为止
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
if(root==nullptr){
return root;
}
invert(root);
return root;
}
void invert(TreeNode* root){
if(root==nullptr){
return;
}
TreeNode* temp;
temp = root->left;
root->left = root->right;
root->right = temp;
invert(root->left);
invert(root->right);
}
};