力扣-二叉树-226 翻转二叉树
思路
利用递归的思路
代码
class Solution {
public:TreeNode* invertTree(TreeNode* root) {if(root == nullptr){return root;}swap( root->right, root->left);invertTree(root->left);invertTree(root->right);return root;}
};
利用递归的思路
class Solution {
public:TreeNode* invertTree(TreeNode* root) {if(root == nullptr){return root;}swap( root->right, root->left);invertTree(root->left);invertTree(root->right);return root;}
};