思路:也是递归处理每个子树
/**
* 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 {
TreeNode* dfs(TreeNode* root)//翻转以root为根节点的子树
{
TreeNode * temp=root->left;
root->left=root->right;
root->right=temp;
if(root->left)
{
dfs(root->left);
}
if(root->right) dfs(root->right);
return root;
}
public:
TreeNode* invertTree(TreeNode* root) {
if(root)
{
return dfs(root);
}
return nullptr;
}
};
不过上面那个思路有点欠缺:
/**
* 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 {
TreeNode* dfs(TreeNode* root)//翻转以root为根节点的子树
{
if(root->left)
{
dfs(root->left);
}
if(root->right) dfs(root->right);
TreeNode * temp=root->left;
root->left=root->right;
root->right=temp;
return root;
}
public:
TreeNode* invertTree(TreeNode* root) {
if(root)
{
return dfs(root);
}
return nullptr;
}
};
显然,我们从根节点开始,递归地对树进行遍历,并从叶子节点先开始翻转。如果当前遍历到的节点 root 的左右两棵子树都已经翻转,那么我们只需要交换两棵子树的位置,即可完成以 root 为根节点的整棵子树的翻转。