leetcode--226. Invert Binary Tree

最新推荐文章于 2023-12-11 08:24:42 发布

小白笑苍

最新推荐文章于 2023-12-11 08:24:42 发布

阅读量291

点赞数

分类专栏： Algorithm Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/toyijiu/article/details/51224110

版权

Leetcode 同时被 2 个专栏收录

122 篇文章 1 订阅

订阅专栏

Algorithm

15 篇文章 0 订阅

订阅专栏

Invert a binary tree.

4
/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1
Trivia:
This problem was inspired by this original tweet by Max Howell:
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.

思路：递归，交换左右子树的指针，不断递归交换直到叶子节点

void swapChildNode(struct TreeNode* fatherNode)
{
    struct TreeNode* temp = fatherNode->left;
    fatherNode->left = fatherNode->right;
    fatherNode->right = temp;
}
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
struct TreeNode* invertTree(struct TreeNode* root) 
{
    if(root == NULL)
    {
        return NULL;
    }

    swapChildNode(root);
    invertTree(root->left);
    invertTree(root->right);

    return root;

}