226. Invert Binary Tree

原创于 2016-09-29 15:47:25 发布 · 194 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode

Leetcode 专栏收录该内容

15 篇文章

订阅专栏

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

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.

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