题目:226. 翻转二叉树
思路:简单的递归,就是交换两边。
/**
* 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;
//临时保存左指针
TreeNode * tmp=root->left;
//将当前左指针用来保存右指针递归完的结果
root->left=invertTree(root->right);
//将当前右指针用来保存左指针递归完的结果
root->right=invertTree(tmp);
return root;
}
};