给你一棵二叉树的根节点 root
,翻转这棵二叉树,并返回其根节点。
方法一:递归
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
if(root == NULL) return root;
TreeNode* temp = root->left;
root->left = root->right;
root->right = temp;
invertTree(root->left);
invertTree(root->right);
return root;
}
};