给你一棵二叉树的根节点 root
,翻转这棵二叉树,并返回其根节点。
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
if(root == nullptr)return root;
TreeNode temp(0,nullptr,nullptr);
temp.left = root->left;
temp.right = root->right;
root->left = temp.right;
root->right = temp.left;
invertTree(root->left);
invertTree(root->right);
return root;
}
};
使用临时节点变量,递归实现