/**
* 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 {
public:
void oper(TreeNode* root,TreeNode* left,TreeNode* right){
if(left==NULL&&right==NULL)return;
root->left=right;
root->right=left;
if(left){
oper(left,left->left,left->right);
}
if(right){
oper(right,right->left,right->right);
}
}
TreeNode* invertTree(TreeNode* root) {
if(root==NULL)return root;
oper(root,root->left,root->right);
return root;
}
};
226. 翻转二叉树
最新推荐文章于 2024-10-15 11:12:27 发布