226. Invert Binary Tree

最新推荐文章于 2023-11-10 09:55:35 发布

happylife39

最新推荐文章于 2023-11-10 09:55:35 发布

阅读量145

点赞数

分类专栏：算法与数据结构 leetcode

本文链接：https://blog.csdn.net/happylife39/article/details/52279925

版权

算法与数据结构同时被 2 个专栏收录

19 篇文章 0 订阅

订阅专栏

leetcode

6 篇文章 0 订阅

订阅专栏

/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
invertTreeCore(root);
return root;

}
void invertTreeCore(TreeNode* root)
{
    if(root == NULL)
        return ;

    TreeNode* temp = root->left;
    root->left = root->right;
    root->right = temp;
    invertTreeCore(root->left);
    invertTreeCore(root->right);

}

};