50.翻转二叉树
题目内容:
代码及思路:
/**
* 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* invertTree(TreeNode* root) {
if(root==nullptr)
return nullptr;
//利用递归的思想,左子树节点变成右子树节点
TreeNode* left=root->left;
root->left=invertTree(root->right);
root->right=invertTree(left);
return root;
}
};