leetcode 226 Invert Binary Tree（难易度：Easy）

最新推荐文章于 2020-12-28 21:55:47 发布

原创最新推荐文章于 2020-12-28 21:55:47 发布 · 378 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode

leetcode 专栏收录该内容

45 篇文章

订阅专栏

本文介绍了一种翻转二叉树的算法实现，通过递归方式交换二叉树节点的左右子节点，最终达到完全翻转整棵树的效果。文章包含了一个C语言的示例代码，并提到了该问题的背景来源。

Invert Binary Tree

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;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

struct TreeNode* invertTree(struct TreeNode* root) {
    if (root == NULL)
	    return NULL;
	struct TreeNode * pTemp = root->left;
	root->left = invertTree(root->right);
	root->right = invertTree(pTemp);
	
	return root;
}

原题地址： https://leetcode.com/problems/invert-binary-tree/