[Leetcode] 226. Invert Binary Tree

翻转二叉树算法

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

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

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一种通过递归算法实现的翻转二叉树方法。该算法通过不断交换二叉树节点的左右子节点来完成整棵树的翻转。示例中展示了输入为特定二叉树时的翻转过程及结果。

Description:

Invert a binary tree.

Example:

Input:

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

Output:

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

Trivia:
This problem was inspired by this original tweet by Max Howell:

/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) {
return null;
}
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;

invertTree(root.left);
invertTree(root.right);

return root;
}
}