Invert Binary Tree

最新推荐文章于 2024-01-28 21:29:53 发布

weixin_30788619

最新推荐文章于 2024-01-28 21:29:53 发布

阅读量33

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/amazingzoe/p/5925384.html

本文介绍了一种翻转二叉树的算法实现，并通过一个具体的示例来展示其效果。该算法采用递归的方式，交换每个节点的左右子树，从而达到整体翻转的目的。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Runtime: 0ms

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     TreeNode* invertTree(TreeNode* root) {
13         if (!root || (!root->left && !root->right)) return root;
14         
15         swap(root->left, root->right);
16         invertTree(root->left);
17         invertTree(root->right);
18         return root;
19     }
20 };