[Leetcode] 226. Invert Binary Tree 解题报告

最新推荐文章于 2024-10-29 00:15:00 发布

原创最新推荐文章于 2024-10-29 00:15:00 发布 · 291 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#解题报告 #Leetcode #Tree

IT公司面试习题专栏收录该内容

736 篇文章

订阅专栏

本文介绍了一种翻转二叉树的算法实现，通过递归方式交换每个节点的左右子节点来完成整个二叉树的翻转。该算法简单高效，易于理解和实现。

题目：

Invert a binary tree.

     4
   /   \
  2     7
 / \   / \
1   3 6   9

     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.

思路：

没什么可说的。。。

代码：

/**
 * 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) {
        if (root != NULL) {
            TreeNode *node = root->left;
            root->left = root->right;
            root->right = node;
            invertTree(root->left);
            invertTree(root->right);
        }
        return root;
    }
};